Uh~x7<£-GL<> 


(^aU^sf- 


THE, 


THEORY  OF  SUBSTITUTIONS 


AND    ITS 


APPLICATIONS  TO  ALGEBRA. 


By  DR.  EUGEN  NETTO, 

Professor  of  Mathematics  in  the  University  of  Giessen. 


Revised    ton   l.he  Author   and    Translated    with    his    Permission 

By  F.  N.  COLE.  Ph.  D., 

Assistant   Professor  of  Mathematics   in    the    \ 
University  of  Michigan. 


ANN  ARBOR,  MICH.: 
THE  register  publishing  company. 
TIbe  llnlanb  press. 
1802. 


QNIVERSITY  OP  ^IJFORNJA 


PREFACE. 


The  presentation  of  the  Theory  of  Substitutions  here  given  differs  in 
several  essential  features  from  that  which  has  heretofore  been  custom- 
ary. It  will  accordingly  be  proper  in  this  place  to  state  in  brief  the 
guiding  principles  adopted  in  the  present  work. 

It  is  unquestionable  that  the  sphere  of  application  of  an  Algorithm 
is  extended  by  eliminating  from  its  fundamental  principles  and  its 
general  structure  all  matters  and  suppositions  not  absolutely  essential 
to  its  nature,  and  that  through  the  general  character  of  the  objects  with 
which  it  deals,  the  possibility  of  its  employment  in  the  most  varied 
directions  is  secured.  That  the  theory  of  the  construction  of  groups 
admits  of  such  a  treatment  is  a  guarantee  for  its  far-reaching  impor- 
tance and  for  its  future. 

If,  on  the  other  hand,  it  is  a  question  of  the  application  of  an  aux- 
iliary method  to  a  definitely  prescribed  and  limited  problem,  the  elab- 
oration of  the  method  will  also  have  to  take  into  account  only  this 
one  purpose.  The  exclusion  of  all  superfluous  elements  and  the 
increased  usefulness  of  the  method  is  a  sufficient  compensation  for  the 
lacking,  but  not  defective,  generality.  A  greater  efficiency  is  attained  in 
a  smaller  sphere  of  action. 

The  following  treatment  is  calculated  solely  to  introduce  in  an 
elementary  manner  an  important  auxiliary  method  for  algebraic  inves- 
tigations. By  the  employment  of  integral  functions  from  the  outset,  it 
is  not  only  possible  to  give  to  the  Theory  of  Substitutions,  this  operat- 
ing with  operations,  a  concrete  and  readily  comprehended  foundation, 
but  also  in  many  cases  to  simplify  the  demonstrations,  to  give  the 
various  conceptions  which  arise  a  precise  form,  to  define  sharply  the 
principal  question,  and — what  does  not  appear  to  be  least  important — to 
limit  the  extent  of  the  work. 

The  two  comprehensive  treatises  on  the  Theory  of  Substitutions 
which  have  thus  far  appeared  are  those  of  J.  A.  Serret  and  of  C.  Jordan. 

The  fourth  section  of  the  "Algebre  Superieure  "  of  Serret  is  devoted 
to  this  subject.  The  radical  difference  of  the  methods  involved  here 
and  there  hardly  permitted  an  employment  of  this  highly  deserving 
work  for  our  purposes.  Otherwise  with  the  more  extensive  work  of 
Jordan,  the  "Traite"  des  substitutions  et  des  Equations  algebriques." 
Not  only  the  new  fundamental  ideas  were  taken  from  this  book,  but  it 
is  proper  to  mention  expressly  here  that  many  of  its  proofs  and  pro^ 


IV  PREFACE. 

>es  of  thought  also  permitted  of  being  satisfactorily  employed  in  the- 
present  work  in  spite  of  the  essential  difference  of  the  general  treat- 
ment.    The  investigations  of  Jordan  not  contained  in  the  "Traits" 
which  have  been  consulted  are  cited  in  the  appropriate  places. 

But  while  many  single  particulars  are  traceable  to  this  "Traits" 
and  to  these  investigations,  nevertheless,  the  author  is  indebted  to  his 
honored  teacher,  L.  Kronecker,  for  the  ideas  which  lie  at  the  foundation 
of  his  entire  work.  He  has  striven  to  employ  to  best  advantage  the 
benefit  which  he  has  derived  from  the  lectures  and  from  the  study  of 
the  works  of  this  scholarly  man,  and  from  the  inspiring  personal  inter- 
course with  him;  and  he  hopes  that  traces  of  this  influence  may  appear 
in  many  places  in  his  work.  One  thing  he  regrets:  that  the  recent  im- 
portant publication  of  Kronecker,  "Grundzuge  einer  arithmetischen 
Theorie  der  algebraischen  Grossen,"  appeared  too  late  for  him  to  derive 
from  it  the  benefit  which  he  would  have  washed  for  himself  and  his 
readers. 

The  plan  of  the  present  book  is  as  follows: 

In  the  first  part  the  leading  principles  of  the  theory  of  substitutions 
are  deduced  with  constant  regard  to  the  theory  of  the  integral  func- 
tions; the  analytical  treatment  retires  almost  wholly  to  the  background, 
being  employed  only  at  a  late  stage  in  reference  to  the  groups  of  solvable 
equations. 

In  the  second  part,  after  the  establishment  of  a  few  fundamental 
principles,  the  equations  of  the  second,  third  and  fourth  degrees,  the 
Abelian  and  the  Galois  equations  are  discussed  as  examples.  After  this 
follows  a  chapter  devoted  to  an  arithmetical  discussion  the  necessity  of 
which  is  there  explained.  Finally  the  more  general,  but  still  elementary 
questions  with  regard  to  solvable  equations  are  examined. 

Stkassburg,  1880. 


To  the  preceding  I  have  now  to  add  that  the  present  translation 
differs  from  the  German  edition  in  many  important  particulars.  Many 
new  investigations  have  been  added.  Others,  formerly  included,  which 
have  shown  themselves  to  be  of  inferior  importance,  have  been  omitted. 
Entire  chapters  have  been  rearranged  and  demonstrations  simplified. 
In  short,  the  whole  material  which  has  accumulated  in  the  course  of 
time  since  the  first  appearance  of  the  book  is  now  turned  to  account. 

In  conclusion  the  author  desires  to  express  his  warmest  thanks  to 
Mr.  F.  N.  Cole  who  has  disinterestedly  assumed  the  task  of  translation 
and  performed  it  with  care  and  skill. 

EUGEN  NETTO. 
GipsSEN,  1892. 


TRANSLATOR'S  NOTE. 


The  translator  has  confined  himself  almost  exclusively  to  the 
function  of  rendering  the  German  into  respectable  English.  My  thanks 
are  especially  due  to  The  Register  Publishing  Company  for  their  gener- 
ous assumption  of  the  expense  of  publication  and  to  Mr.  C.N.  Jones,  of 
Milwaukee,  for  valuable  assistance  while  the  book  was  passing  through 

the  press. 

F.  N.  COLE. 

Ann  Arbor,  February  27,  1892. 


TABLE  OF   CONTENTS. 


PART  I. 

Theory  of  Substitutions  and  of  Integral  Functions. 

CHAPTER  I. 

SYMMETRIC    OR    SINGLE-VALUED   FUNCTIONS ALTERNATING    AND   TWO-VAL- 
UED   FUNCTIONS.  / 

1-3 .  Symmetric  and  single-valued  functions. 

4 .  Elementary  symmetric  functions. 

5-10.  Treatment  of  the  symmetric  functions. 

11.  Discriminants. 

12.  Euler's  formula. 

13.  Two- valued  functions;  substitutions. 

14.  Decomposition  of  substitutions  into  transpositions. 

15.  Alternating  functions. 

16-20.  Treatment  and  group  of  the  two-valued  functions. 

CHAPTER  II. 

MULTIPLE-VALUED    FUNCTIONS    AND    GROUPS    OF    SUBSTITUTIONS.  /  % 

22 .  Notation  for  substitutions. 

24 .  Their  number. 

25 .  Their  applications  to  functions. 
26-27.  Products  of  substitutions. 

28.  Groups  of  substitutions. 

29-32 .  Correlation  of  function  and  group. 

34.  Symmetric  group. 

35.  Alternating  group. 

36-38.  Construction  of  simple  groups. 

39-40 .  Group  of  order  pf. 

CHAPTER  III. 

THE    DIFFERENT     VALUES     OF     A    MULTIPLE-VALUED     FUNCTION     AND    THEIR 

ALGEBRAIC    RELATION    TO    ONE    ANOTHER.  ty  *{ 

41-44 .  Relation  of  the  order  of  a  group  to  the  number  of  values 

of  the  corresponding  function. 


Ylll  CONTENTS. 

U>.  Croups  belonging  to  the  different  values  of  a  function. 

16   17.  Transformation. 

48-50.  The  Cauchy-Sylow  Theorem. 

51.  Distribution  of  the  elements  in  the  cycles  of  a  group. 

52.  Substitutions  which  belong  to  all  values  of  a  function. 

53.  Equation  for  a  ^-valued  function. 

55.  Discriminants  of  the  functions  of  a  group. 

50-59.  Multiple-valued    functions,  powers  of   which    are    single- 

valued. 

CHAPTER  IV. 

TRANSITIVITY    AND    PRIMITIVITY. SIMPLE    AND    COMPOUND    GROUPS. 

ISOMORPHISM.  7  * 

60-61.  Simple  transitivity. 

62-63.  Multiple  transitivity. 

64.  Primitivity  and  non-primitivity. 

65-67 .  Non-primitive  groups. 

68.  Transitive  properties  of  groups. 

69-71.  Commutative  substitutions;  self-conjugate  subgroups. 

72-73.  Isomorphism. 

74-76.  Substitutions  which  affect  all  the  elements. 

77-80.  Limits  of  transitivity. 

81-85.  Transitivity  of  primitive  groups. 

86.  Quotient  groups. 

87.  Series  of  composition. 

88-89.  Constant  character  of  the  factors  of  composition. 

91 .  Construction  of  compound  groups. 

92.  The  alternating  group  is  simple. 

93 .  Groups  of  order  p\ 

94.  Principal  series  of  composition. 

95.  The  factors  of  composition  equal  prime  numbers. 

96.  Isomorphism. 

(.»7  98.  The  degree  and  order  equal. 

99-101.  Construction  of  isomorphic  groups. 

CHAPTER  V. 

ALGEBRAIC     RELATIONS     BETWEEN     FUNCTIONS     BELONGING     TO     THE    SAME 

GROUP. — FAMILIES    OF    MULTIPLE-VALUED    FUNCTIONS.  / / *f 

103-105.        Functions  belonging  to  the  same  group  can  be  rationally 
expressed  one  in  terms  of  another. 

106.  Families;  conjugate  families. 

107.  Subordinate  families. 


CONTENTS.  IX 

108-109.        Expression  of   the    principal    functions  in  terms  of   the 
subordinate. 

110.  The  resulting  equation  binomial. 

111.  Functions  of  the  family  with  non-vanishing  discriminant. 

CHAPTER  VI. 

THE    NUMBER    OF    THE    VALUES    OF    INTEGRAL    FUNCTIONS.  /*<  8 

112.  Special  cases. 

113.  Change  in  the  form  of  the  question. 

114-115 .  Functions  whose  number  of  values  is  less  than  their  degree. 

116.  Intransitive  and  non-primitive  groups. 

117-121.  Groups  with  substitutions  of  four  elements. 

122-127 .  General  theorem  of  C.  Jordan. 

CHAPTER  VII. 

CERTAIN    SPECIAL    CLASSES    OF    GROUPS.  /  Lf.  U 

128 .  Preliminary  theorem. 

129 .  Groups  ft  with  r  —  n  —  p.    Cyclical  groups. 

130.  Groups  £2  with  r  =  n=ji-  q- 

131.  Groups  ft  with  r  =  n-p2. 

132-135.        Groups  which  leave,  at  the  most,  one  element  unchanged.— 

Metacyclic  and  semi-metacyclic  groups. 
136.  Linear  fractional  substitutions.     Group  of   the  modular 

equations.  \ 

137-139.        Groups  of  commutative  substitutions. 

CHAPTER  VIII. 

ANALYTICAL     REPRESENTATION    OF     SUBSTITUTIONS. THE     LINEAR     GROUP.  /  (y  O 

140.  The  analytical  representation. 

141 .  Condition  for  the  defining  function. 

143.  Arithmetic  substitutions. 

144.  Geometric  substitutions. 

145.  Condition  among  the  constants  of  a  geometric  substitution. 
146-147.  Order  of  the  linear  group. 


PART  II. 

Application  of  the  Theory  of  Substitutions  to  the  Algebraic 

Equations. 

CHAPTER  IX. 

the    equations  of    the  second,  third  and  fourth   degrees. GROUP 

OF  AN    EQUATION. RESOLVENTS.  '   °    ° 

148.  The  equations  of  the  second  degree. 


X  CONTENTS. 

1 19.  The  equations  of  the  third  degree. 

The  equations  of  the  fourth  degree. 

The  general  problem  formulated.    Galois  resolvents. 
154.        Aifect  equations.    Group  of  an  equation. 
156  Fundamental  theorems  on  the  group  of  an  equation. 

Group  of  the  Galois  resolvent  equation. 
158  159.  eneral  resolvents. 

CHAPTEK  X. 

THE    CYCLOTOMIC    EQUATIONS.  ■ 

161 .  I  definition  and  irreducibility. 

162.  Solution  of  cyclic  equations. 

163.  Investigation  of  the  operations  involved. 
164-165  Special  resolvents. 

166.  <  onstruction  of  regular  polygons  by  ruler  and  compass. 

The  regular  pentagon. 

168.  The  regular  heptadecagon. 

169  170.  Decomposition  of  the  cyclic  polynomial. 

CHAPTEK  XL 

THE    ABELIAN    EQUATIONS.  /  f  7 

171-172.  One  root  of  adequation  a  rational  function  of  another. 

173.  Construction  of  a  resolvent. 

171-17.";.  Solution  of  the  simplest  Abelian  equations. 

17C  Employment  of  special  resolvents  for  the  solution. 

177.  Second  method  of  solution. 

180.  Examples. 

181 .  Abelian  equations.    Their  solvability. 

182.  Their  group. 

183.  Solution  of  the  Abelian  equations;  first  method. 
184  186.  Second  method. 

187.  Analytical  representation  of  the  groups  of  primitive  Abelian 

equations. 
188-189.        Examples. 

CHAPTER  XII. 

EQUATIONS  WITH  RATIONAL  RELATIONS  BETWEEN  THREE  ROOTS.        U,  2.  -2, 

190-193.        Groups  analogous  to  the  Abelian  groups. 

194.  Equations  all  the  roots  of  which  are  rational  functions  of 

t  wo  among  them. 
196.  Their  group  in  the  case  n  —p. 

I'.i7 .  The  binomial  equations. 


CONTENTS. 


XI 


199.  Triad  equations. 

200-201 .  Constructions  of  compound  triad  equations. 

202.  Croup  of  the  triad  equation  for  n  =  7. 

203-205.  Group  of  the  triad  equation  for  n  =  9 

206 .  Hessian  equation  of  the  ninth  degree. 

CHAPTER  XIII. 

THE    ALGEBKAIC    SOLUTION    OF    EQUATIONS. 

207-209.  Rational  domain.    Algebraic  functions. 

210-211.  Preliminary  theorem. 

212-216.  Roots  of  solvable  equations. 

217.  Impossibility  of  the  solution  of  general  equations  of  higher 

degrees. 

218.  Representation  of  the  roots  of  a  solvable  equation. 

219.  The  equation  which  is  satisfied  by  any  algebraic  expression. 
220-221.        Changes  of  the  roots  of  unity  which  occur  in  the  expres- 
sions for  the  roots. 

222-224 .        Solvable  equations  of  prime  degree. 

CHAPTER  XIY. 

THE    GROUP    OF    AN    ALGEBRAIC    EQUATION. 

226.  Definition  of  the  group. 

227.  Its  transitivity. 

228.  Its  primitivity. 

229.  Galois  resolvents  of  general  and  special  equations. 

230.  Composition  of  the  group. 

231 .  Resolvents. 

232-234.        Reduction  of  the  solution  of  a  compound  equation. 
235.  Decomposition  of  the  equation  into  rational  factors. 

236-238.        Adjunction  of  the  roots  of  a  second  equation. 

CHAPTER  XV. 

ALGEBRAICALLY    SOLVABLE    EQUATIONS. 

239-241 .  Criteria  for  solvability. 

242 .  Applications. 

243.  Abel's  theorem  on  the  decomposition  of  solvable  equations. 

244.  Equations  of  degree  pk;  their  group. 
2  ir;.  Solvable  equations  of  degree  p. 
246.  Solvable  equations  of  degree  p2. 

248-249.        Expression  of  all  the  roots  in  terms  of  a  certain  number  of 
them. 


JiHo 


166 


±%L 


ERRATA. 


p.  7,  footnote,  for  transformatione  read  transmutatione. 

p.  15,  line  10,  read  <p  =  S  V  J . 

p.  16,  line  5,  read  $r, —  <f.2  =  2S2  s/  A. 

p.  28,  line  9,  for  c  read  <1>. 

p.  29,  line  12,  for  '/'read  <f>. 

p.  29,  line  9,  from  bottom,  for  <J>  read  W. 

p.  31,  line  8,  read  G  =  [1,  {xxx2)  (x3x^),  (x^)  (x2xt),  (x^)  (x2x3)~\. 

p.  41,  line  7,  for  p  read  pf. 

p.  52,  line  13,  read  a<pa-\-b^>T.     _ 

p.    52,  line  5,  from  bottom,  for  —  read  -4~. 

da  da 

p.    89,  line  2,  for  not  more  read  less. 

p.    93,  line  9,  for  a  group  H  read  a  primitive  group  H. 

p.    94,  line  2,  for  n  —  q  -\-  2  read  n  —  q-\-k. 

p.    98,  line  19,  for  %J>'b$c  read  §a3Vc 

p.  101,  line  3,  for  il,  read  £>', . 

p.  103,  line  14,  read  [1,  (z,22)]- 

p.  125,  Theorem  XI,  read:    In  order  that  there  may  be  a pp-valued 

function  /    a  prime   power  yp   of   which  shall   have   p 

values,  etc. 
p.  159,  lines  10,  11  from  bottom,  read:    Since  <r1  belongs  to  r, ,  at 

least    one  of    the  exponents    //,  >,...,.  the  s  of  which 

belongs  to  1\ ,  must  be  prime  to  rx . 
p.  166,  line  4,  read   ra,  t2r2,  t3r2,  .  .  . 
p.  174,  line  2,  for  c,  read  2cj. 
p.  210,  foot  note,  for  No.  XI,  etc.,  read  478-507,  edition  of  Sylow 

and  Lie. 
p.  219,  line  10,  for  t(cos  a)  read  0x(cos  a). 
p.  224,  line  2  from  bottom,  read:  which  leaves  two  elements  with 

successive  indices  unchanged. 
p.  248,  line  3  from  bottom,  read  V**+Y  =  Fa  +  l(Va  +  a,  .  .  .). 


PART  I. 

THEORY  OF    SUBSTITUTIONS  AND  OF    THE    INTEGRAL 

FUNCTIONS. 


CHAPTER  I. 

SYMMETRIC     OR    SINGLE -VALUED    FUNCTIONS.     ALTERNA- 
TING  AND  TWO-VALUED  FUNCTIONS. 

§  1.  In  the  present  investigations  we  have  to  deal  with  n  ele- 
ments xu  x2,  .  .  .  xn,  which  are  to  be  regarded  throughout  as  entirely 
independent  quantities,  unless  the  contrary  is  expressly  stated.  It 
is  easy  to  construct  integral  functions  of  these  elements  which  are 
unchanged  in  form  when  the  x^B  are  permuted  or  interchanged  in 
any  way.     For  example  the  following  functions  are  of  this  kind : 

3Jj     — (—  .To     -p  Xj     -p    .  .  .    ~~p  Xn    , 

■•\a  x-f  +  ^ia  x£  +  •  •  •  +  x?~  &f  +  xia  xf  +  •  •  • 

I      '**/<      Xl      -  •  •       I      <&n      ■'     ,;  —  l  j 

'    ''  -''j)"    \.Xl  ^3)      '-''j  Xi)~     '   •   •     \X'i  —  \  Xn)r 

etc. 

Such   functions    are  called   symmetric    functions.     "We    confine 
ourselves,  unless  otherwise  noted,  to  the  case  of  integral  functions. 

If  the  ,rA*s  be  put  equal  to  any  arbitrary  quantities,  a} ,  a2, .  .  .  a,  , 
so  that  a\  =  a]:  x2  =  a,,  .  .  .  x„  =  a„,  it  is  clear  that  the  symmetric 
functions  of  the  x^s  will  be  unchanged  not  only  inform,  but  also  in 
value  by  any  change  in  the  order  of  assignment  of  the  values  a  a.  to 
the  X\B.  Such  a  reassignment  may  be  denoted  bv 
x1  =  ah,  x2  =  «,_,,  .  .  .  x„  =  a,n 
where  the  a([,  a,,,  .  .  .  denote  the  same  quantities  a„  a2,  ...  in  any 
one  of  the  possible  n !  orders. 

Conversely,  it    can    be    shown    that    every  integral    function, 
<p{x^  x2  ...    x„)  ,  of  n  independent  quantities  xu  x2,  .  .  .  xn}  which 


'J  THEORY    or    81  B8T]  I  I   nON8. 

La  anohanged  in  value  by  all  the  possible  permutations  of  arbitrary 

values  of  the  'a's,  is  also  unchanged  in  form  by  these  permutations. 

Theorem  I.  Every  single-valued  integral  function  of  n 
indept  nd<  nt  elements  .'•,.  .<■_.,  .  .  .  x„  is  symmetric  in  these  elements. 

£  '1.  The  reasoning  on  which  the  proof  of  this  theorem  is 
based  will  be  of  frequent  application  in  the  following  treatment. 
It  seems,  therefore,  desirable  to  present  it  here  in  full  detail. 

(A).     If  in  the  integral  function 

(1)  fix)  =  2    aA-a* 

>.  =  o 

all  the  coefficients  aA  are  equal  to  zero,  then  /(•<')  vanishes  identi- 
cally, i.  e.,  f(.v)  is  equal  to  zero  for  every  value  of  x.  Conversely, 
if  /*(.')  vanishes  for  every  value  of  x,  then  all  the  coefficients  d\  are 
equal  to  zero. 

For  if  f(x)  is  not  identically  zero,  then  there  is  a  value  '~„  such 
that  for  every  real  x  of  which  the  absolute  value  x  is  greater  than 
~0,  the  value  of  the  function /(a?)  is  different  from  zero.  For  £0  we 
may  take  the  highest  of  the  absolute  values  of  the  several  roots  of 
the  equation  /(.*■)  =  0.  Without  assuming  the  existence  of  roots 
of  algebraic  equations,  we  may  also  obtain  a  value  of  "„  as  follows:* 

Let  ak.  be  the  numerically  greatest  of  the  n  coefficients  a0,  ot, 

a,    ,  in  (1),  and  denote  -  '  by  r.     We  have  then 

'""         '''  "•"   '"""  (   x\"     '+.<"    -'+...  +  1, 


a, 


< 

ok 

— 

a„ 

< 

ak 

= 

<-',, 

1 


a"  I — 1 


<  I  — 1 

Hence,  for  any  value  of  x  not  lying  between  -    r  and  +  r, 

a     ,-'•"    '  +a„  ,r  2+     ..  +a0 


-i    i    .,  - 


< 


so  that  the  sign  of  /(.<•)  is  the  same  as  that  of  a   x".     Consequently, 
we  may  take  T„  =  /•. 

•  i.  Kr :cker.   i  irelle  101,  i>.  :ut. 


SYMMETRIC    AXD    TWO-VALUED    FUNCTIONS.  ■> 

(B).     If  no  two  of  the  integral  functions 

(2)  /i  (*),/.(*),.../-(*) 

are  identically  equal  to  each  other,  then  there  is  always  a  quantity 
~„  such  that  for  every  x  the  absolute  value  of  which  is  greater  than 
£0,  the  values  of  the  functions  (2)  are  different  from  each  other. 

For,  if  we  denote  by  ra3  the  value  determined  for  the  function 
fa  (•«')  — //3  (#),  as  r  was  determined  in  (A),  we  may  take  for  ~„  the 
greatest  of  the  quantities  rap. 

(C).     If  in  the  integral  function 


/(■'•,.  ■''_.,  .  .  .  ■<•„) 


"S«.«.  . .         *     r.M  r.M 


\i  A 


all  the  coefficients  a  are  equal  to  zero,  then  the  function/  vanishes 
identically,  *.  e.,  the  value  of  /  is  equal  to  zero  for  every  system  of 
values  of  xt,  x2i  .  .  .  x„. 

To  prove  the  converse  proposition  we  put 

(3)  •<•,,  =  g,     x,  =  gv,     x,  =  g*,       .  .  .  x„  =  gvn~l 

.i\xl  x2Ki  .  .  .  .»„ A"-  then  becomes  a  power  of  g,  the  exponent  of 
which  is 

J-A!  A,   •   •   •    Km   =    /,    +  KV   +  V  +    •  •   •    KS"-1 

From  (B),  we  can  find  a  value  for  v  such  that  for  all  greater  val- 
ues of  v,  the  various  ?'Ai  a:  •  •  •  Km  are  all  different  from  one  another. 
"We  have  then 

/(,*-!,  a-,,  .  .  .  xm)  =  2  aMX,  .  .  .  Km  gr*  *«■•.•  *« 

But,  from  (A),  if  all  the  coefficients  a  do  not  disappear,  we  can 
take  g  so  large  that  /  is  different  from  0.  The  converse  proposition 
is  then  proved. 

(D).     If  a  product  of  integral  functions 

(4)  /,  (asn  ar«,  .  .  .  #„)  fi{xux2,  . .  .  xn)  . . .  fm  {xux2,  .  .  .  xn) 

is  equal  to  zero  for  all  systems  of  values  of  the  £cA's,  then  one  of  the 
factors  is  identically  zero. 

For,  if  we  employ  again  the  substitution  (3),  we  can,  from  (C), 
select  such  values  ga  and  va  for  any  factor  fa  (a?j ,  x2,  ...  xn)  which 
does  not  vanish  identically,  that  for  every  system  of  values  which 
arises  from  (3 )  when  g  >  ga  and  v  >  >a  the  value  of  fa  is  different 
from  zero.  If  then  we  take  g  greater  than  gu  g2,  . . .  g„  and  at  the 
same  time  v  greater  than  vt ,  v2 ,  ...  v„  we  obtain  systems  of  values 


4  THEORY    OF   StTBSTITUTIONS. 

of  the  .cA's  for  which  (4)  does  not  vanish,  unless  one  of  the  factors 
vanishes  identically. 

The  proof  of  Theorem  I  follows  now  directly  from  (C).  For  if 
c  .»,,....  x  i  is  a  single-valued  function,  and  if  e-,  (.<•,.  .r,  .  .  .  a?„) 
arises  from  95  by  any  rearrangement  of  the  .rA's,  then  it  follows  from 
tin*  fact  that  c  has  only  one  value,  that  the  difference 

C   (•<",,    .t\  ,    .    .    .    X„  )  CT]     ( Xj  ,   •  <'_>,     .    .    .     Xn) 

vanishes  identically. 

If  the  elements  xK  are  not  independent,  Theorem  I  is  no  longer 
necessarily  true.  For  instance,  if  all  the  .rA's  are  equal,  then  any 
arbitrary  function  of  the  X\S  is  single-valued.     Again  the  function 

r  ;j.iy'  -<'j  —  4a?]  .tv  +  3  •<'/  is  single-valued  if  a?,  —  2.r.,,  although 
it  is  unsymmetric. 

§  3.  If,  in  any  symmetric  function,  we  combine  all  terms  which 
only  differ  in  their  coefficients  into  a  single  term,  and  consider  any 
one  of  these  terms,  Cxfx^xJ,  ...,  then  the  symmetric  character 
of  the  function  requires  that  it  should  contain  every  term  which  can 
be  produced  from  the  one  considered  by  any  rearrangement  of  the 
•  "-.  If  these  terms  do  not  exhaust  all  those  present  in  the  func- 
tion there  will  still  be  some  term,  C'xf'  x.f  .c/  ...  in  which  the  sys- 
tem of  exponents  is  not  the  same  as  in  the  preceding  case.  This 
term  then  gives  rise  to  a  new  series  of  terms,  and  so  on.  Every 
symmetric  function  is  therefore  reducible  to  a  sum  of  simpler  sym- 
metric functions  in  each  of  which  all  the  terms  proceed  from  any 
single  one  among  them  by  rearrangement  of  the  X\S.  The  several 
terms  of  any  one  of  these  simple  functions  are  said  to  be  of  the 
same  type  or  similar.  Since  these  functions  are  deducible  from  a 
single  term,  it  will  suffice  to  write  this  one  term  preceded  by  an  S. 
Thus  S  (./  )  denotes  in  the  case  of  two  elements  .»',-  -f-  .<•_.-',  in  the 
case  of  three  .<y  -j-  x'r  -+-  .r:i\  etc. 

^  t.  If  we  regard  the  elements  .r,,  .<•,,  .  .  .  xn  as  the  roots  of  an 
«■> [nation  of  the  nth  degree,  this  equation,  apart  from  a  constant  fac- 
tor, has  the  form 

(5)  f(x)  =  (x      .'•,)(..•       .<•,)...(.<•  —  xn)  =  0 

the  left  member  of  which  expanded  becomes 


SYMMETRIC    AND    TWO-VALUED    FUNCTIONS.  O 

(6)  .<■       (.r,  +£ca+  . ..  +-<•„)  a?"-1 

1       v'*I  '*'-'      I      '''l   ''   ;   ~~  *^2  «**3      I       •  •  •       I     '''«-I  &<n)3' 
.  .  •    ~\~   i         J.  J     3(*i  dCo    •  •  •    v"n  • 

=  X'"  —  c,  x"^  +  c  _,.»•"  -'    -  .  .  .  +  (—  l)"c„ 
The  coefficients  of  the  powers  of  jc  in  this  equation  are  there- 
fore simple  integral  symmetric  functions  of  the  X\s: 

(7)  ci  —  S  (..rj),        c.  =  S  (.r,  ,r.,),       cK  =  S  (^  X2  .' .  .  .<■,■,  ). 

C„  =  S  (/,  Xo  .  .  .  £T„)  =  SCj  .('_,  .  .  .  .i\, 

These  combinations  cA  are  called  the  elementary  symmetric 
functions.  They  are  of  special  importance  for  the  reason  that  every 
symmetric  function  of  the  oYs  can  be  expressed  as  a  rational  inte- 
gral function  of  the  cA's. 

§  5.  Among  the  many  proofs  of  this  proposition  we  select  that 
of  Gauss.  * 

We  call  a  term  x™1  a?2mj  x™3 .  .  .  higher  than  xf1  .r/2  a*/3  .  .  .  when 
the  first  of  the  differences  m^  —  v^m, — I'^^h — !'■.>,■<  ■••  which 
does  not  vanish  is  positive.  This  amounts  then  to  assigning  an  arbi- 
trary standard  order  of  precedence  to  the  elements  .rA. 

In  accordance  with  this  convention,  cl5  c2,  c3,  . ...  C\}  . . .  have 
for  their  highest  terms  respectively 

it    1     ■  tASt     (<    1     *  *K>  1     kK.    i    (A/Q    •  •     •     ■       tA    1      it     i     M/Q      •     ■     «      i,i  \  ^  •     *      • 

and  the  function  of  cf  c3?  .  .  .  has  for  its  highest  term 

faa  +  ?  +  y  +  . . .  x^  +  y  +  . . .  ^y  +  . . . 

In  order,  therefore,  that  the  highest  terms  of  the  two  expressions, 
Cja  cf  c:1v  .  .  .  and  c,a'  cf  c/  .  .  .  may  be  equal,  we  must  have 

«  +  ,5  +  /-+...  =«'+/3'  +  r'+... 

/J  +  r+...=  ,5'+/+  ... 

r  +  •  •  •  =  /-'+•.. 


that  is,  a  =  «',  ,5  =  /?',  j'  =  /,  .  .  . 

It  follows  that  two  different  systems  of  exponents  in  cxa  cf  cJ .  .  . 
give  two  different  highest  terms  in  the  X\8.     Again  it  is  clear  that 

xfxfxj ...  {a>fi>r>dm.m) 

is  the  highest  term  of  the  expression  cf^  cf~  vc3y~&.  .  .  and  that 

*  Demonstratio  nova  altera  etc.    Gesammelte  Werke  III.  §  5,  pp.  37-38.   Cf.  Kron- 
ecker.  Monatsberichte  der  Berliner  Akademie,  1889,  p.  943  seq. 


6  THEORI    OF    SUBSTITUTIONS. 

all  the  terms  in  the  expansion  of  this  expression  in  terms  of  the  .rA"s 
are  of  the  same  degree. 

§  6.  If  now  a  symmetric  function  S  be  given  of  which  the 
highest  term  is 

A  xfxfxfxf  ...  (a     '  .'        ,'"'-...) 

the  difference 

S — A  cf-tcf— *  csv~s  .  .  .  =  N, 

will  again  be  a  symmetric  function ;  and  if,  in  the  subtrahend  on  the 
left,  the  values  of  the  cA's  given  in  (7)  be  substituted,  the  highest 
term  of  S  will  be  removed,  and  accordingly  a  reduction  will  have 
been  effected. 

If  the  highest  term  of  S,  is  now  A1  ,x\a'  xf  .'•;/'  .<•/'  .  .  . ,  then 

s}  —  a\  c,a'  ~  v  cf  -  y  c.y  -»...=  s2 

is  again  a  symmetric  function  with  a  still  lower  highest  term.  The 
degrees  of  S2  and  St  are  clearly  not  greater  than  that  of  S,  and  since 
there  is  only  a  finite  number  of  expressions  xfxf  .<■■/  ...  of  a  given 
degree  which  are  lower  than  xf  -v.f  .ry  .  .  .,  we  shall  finally  arrive  by 
repetition  of  the  same  process  at  the  symmetric  function  0 ;  that  is 

Sk—Akc/k)-^k)c/k)-y{k)  ...  =  0; 
and  accordingly  we  have 

s  =  a,  cf-ficf-y . ..  -\-A2claf-ii'c2f,'-y'...  +  . .  . 

§  7.  It  is  also  readily  shown  that  the  expression  of  a  symmetric 
function  of  the  .rA's  as  a  rational  function  of  the  C\8  can  be  effected 
in  only  one  way. 

For,  if  an   integral   symmetric  function    of    « , .  .« c,  could 

be  reduced  to  two  essentially  different  functions  of  cn  <•_, ,  ...  c„, 
V  ''i,  c2,  .  .  .  c„)  and  </>  (c,,  <-,,.  .  .  c„),  then  we  should  have,  for  all 
values  of  the  .rA's,  the  equation 

V  ('-,,  '•_.,  .  .  .  c„)  =  c'-fC,,?,.  ...  cn) 

The  difference  <f  —  c',  which,  as  function  of  the  cA's,  is  not 
identically  zero,  since  otherwise  the  two  functions  <p  and  c'1  would 
coincide,  must,  as  function  of  the  .»\v's,  be  identically  zero. 

Suppose,  now,  that  in  (f  —  <p  those  terms  in  cn  c. ,  .  .  .  c„  which 
cancel  each    other    are  removed,  and    let  anv  remaining  term    be 


SYMMETRIC    AND    TWO-VALUED    FUNCTIONS.  { 

B  c,a  cf  c.y  .  .  .  This  term  on  being  expressed  in  terms  of  the  <  - 
will  give  as  highest  term 

B  x*  +  p  hY+...   oc.f  +  y+  ■••  .r:jv  +  •;•. 

Now  the  different  remaining  terms  B'  cf'  cf  c3*' .  .  .give  different 
highest  terms  in  the  X\B  (§5).  Consequently  among  these  highest 
terms  there  nmst  be  one  higher  than  the  others.  But  the  coefficient 
of  this  term  is  not  zero;  and  consequently  (§  2  (C))  the  function 
c  —  (!'  cannot  be  identically  zero.     We  have  therefore 

Theorem  II.  An  integral  symmetric  function  of  xu  x2,...x„ 
mu  always  be  expressed  in  one  and  only  one  way  as  an  integral 
function  of  the  elementary  symmetric  functions  cn  c2,  ...  c„. 

§  8.  If  we  write  sA  =  S  (x^)  for  the  sum  of  the  /  powers  of 
the  n  elements  xx,  x2,  ...  xni  we  might  attempt  to  calculate  the  sA's 
as  functions  of  the  Cj's  by  the  above  method.  It  is  however  simpler 
to  obtain  this  result  by  the  aid  of  two  recursion  formulas  first  given 
by  Newton  *  and  known  under  his  name.     These  formulas  are 

A)  sr—c1sr_l  +  c2sr_2—.  .  .  +(—  l)"c„sr_„  =  0      (  r  >  n) 

B)  s,.  —  c1sr_1+c2s,._2—  ...  +  (—  l)rrcr=0        (r^w) 

These  two  formulas  can  be  proved  in  a  variety  of  ways.  The 
formula  A)  is  obtained  by  multiplying  the  right  member  of  (6) 
by  xr~ n,  replacing  a? by  xk,  and  taking  the  sum  over  /  =  1,  2, . .  .n. 

The  formula  B )  may  be  verified  with  equal  ease  as  follows.     If 
we  represent  the  elementary  symmetric  functions  of  x2,  r, ,  ....-• 
by  c/,  c2,  .  .  .  c'„_],  we  have 

C\  —  &1  ~T~  Cl  1  @2  = '-   '*'l  C\     T"  C2  5         C3  -—  fy  Cl    TC8) 

and  accordingly,  if  r  <  n,  we  have 

,<y  —  Cj  atf-1  +  c2  .r/-"5^-  .  .  .  (—1)  rcr 
=  xS—Cx,  +  c/)  xf~x+  {xtf  +  c2')  o^-2— .  .  . 
+  (— iy(Xlc'r_1+cr')=(— VfcJ 

and  hence,  replacing  xx  successively  by  x2,  x3,  .  .  .  xni  and,  corres- 
pondingly, e,.'  by  c,.",  c,.'",  .  .  .  c,.{"\  and  taking  the  sum  of  the  n 
resulting  equations 

sr  —  c1sl._1  -\-  c.,sr_.y —  . . .  ( — l)rc,.  n 
=  (  —  1  )*"  (c,!  +  c,"  +  c,!"  +  .  .  .  +  <V"  ). 

'Newton:    Arith.  Univ.,  De  Tnuisformatione  Aequationum. 


So 

— 

11 

«l 

= 

cl 

*-■ 

= 

9 

s3 

= 

<h° 

s4 

= 

of 

So 

= 

<■; 

8  THEORY    OF    SUBSTITUTION-. 

The  right  member  is  symmetric  in  a?, ,  .<•_, , .  .  .  x„ ,  and  contains  all 
the  terms  of  c,.  and  no  others.  Moreover,  the  term  a?,  ,r,  .  .  .  .»-,. ,  and 
consequently  every  term,  occurs  n  —  r  times.    Accordingly  we  have 

sr — CiSr_,  +  c2s,._2—  . . .  +  (— 1  )rc..n  —  ( — l)r(w— r)cr, 
.  •  .  s,.  —  C1«r_,  +  f.,s,._2--  .  .  .  ( —  l)r  c,r  =  0, 
and  formula  B)  is  proved.  *     The  formula  A)  can  obviously  be  veri- 
fied in  the  same  way. 

§  9.     The  solution  of  the  equations  A)  and  B)  lor  the  successive 
values  of  the  sA's  gives  the  expressions  for  these  quantities  in  terms 
of  the  C\S.      The  solution  is  readily  accomplished  by  the    aid  of 
determinants.     We  add  here  a  few  of  the  results.f 
C) 

Si  =  (h 

2c, 

3oiC2  +  3c3 

e*  -  -  4ci2c2  +  4'y   -  -  2c,,2  ■   -  4c4 

&Ci%  +  5cj2c3  +  w\c;  —  5c;c4  —  5c2c3  +  5cs 

It  is  to  be  observed  here  that  all  the  eA's  of  which  the  indices  are 
greater  than  n  are  to  be  taken  equal  to  0.  This  is  obvious  if  we  add 
to  the  n  elements  .r, ,  x  _, ,  .  .  .  xn  any  number  of  others  with  the 
value  0 ;  for  the  eA's  up  to  e„  will  not  be  affected  by  this  addition, 
while  cn+1 ,  en+2,  . . .  will  be  0.  ■ 

§  10.  The  observation  of  §  5  that  c,a  c.f  c8"V .  .  .  gives  for  its  highest 
term  .r,a  +  0  +  y  +  ■■■  x.f  +  v  +  •  ■•  x3v  +  ; ••.  can  be  employed  to  facili- 
tate the  calculation  of  a  symmetric  function  in  terms  of  the  rA's. 

We  may  suppose  that  the  several  terms  of  the  given  function 
are  of  the  same  type,  that  is  that  they  arise  from  a  single  term 
among  them  by  interchanges  of  the  a-A's .  The  function  is  then 
homogeneous;  suppose  it  to  be  of  degree  v.  We  can  then  obtain 
its  literal  part  at  once. 

For,  if  the  function  contains  one  element,  and  consequently  all 
elements,  in  the  mth  and  no  higher  power,  then  every  term  of  the 
corresponding  expression  in  the  (\"s  will  be  of  degree  m  at  the  high- 
est.    For,  in  the  first  place,  two  different  terms  (\a  cf  ejt  .  .  .  and 

•Another,  purely  arithmetical,  proof  is  given  by  Euler;  Opuscula  Varii  Argumenti. 
Deiiionstr.it.  genuina  tbeor.  Newtonian!,  II.  p.  108. 
+  C/.  Fa;i  dt  I'.runo:  Formes  Blnaires. 


SYMMETRIC    AND    TWO-VALUED    FUNCTIONS.  9 

ef'  cfi'  c,y'  .  .  .  give  different  highest  terms  in  the  .rA's ,  so  that  two 
such  terms  cannot  cancel  each  other;  and,  in  the  second  place, 
<V  rf  r.;7  •  •  ■  gives  a  power  <»'Aa  +  0  +  v  +-.-j  so  that 

"■  +  ?  +  Y  +  •  •  •  £  ™- 
Again  the  degree  of   xta  +  P  +  y  +  ■■•  x2  p  +  y  +  •■•  x3y  +  •.-.   .     is 

and     since     the    given     expresssion    is     homogeneous,     the    sum 
a  -J-  2  /?  -f-  3  y  +  ...  must  be  equal  to  v  for  every  term  of  cf  cj  .  .  . 
These  two  limitations  imposed  on  the  exponents  of  the  cA's  that 
a  +  £  +  y  -\-  .  .  .   <  m,  a  +  2  (3  +  3  y  •  •  •    =  vi 

exclude  a  large  number  of  possible  terms.  The  coefficients  of  those 
that  remain  are  then  calculated  from  numerical  examples.  The 
quantity  a  -f-  2  {i  +  3  y  +  •  •  •  is  called  the  weight  of  the  term 
°ia  cf  c3y-  •  •  an<i  a  function  of  the  C\S  whose  several  terms  are  all  of 
the  same  weight  is  called  isdbaric.  For  example 
S  (.'•;-  x r  .r,-'  xt  )  =  q0e1  +  qx  e6  cl  +  q,  c5  c,  +  q,  r4  e3       (m  =  2,  v  =  7) 

S  [(  a?,  —  x.2) 2  (pc,  —  x3y  (pc3  —  x,  )2]  =  q0  c6  +  q1  c5  c,  +  g2  c4  c2 
+  g3  <*4  (\2  +  qi  <V  +  q,  %  c2  c,  +  q,  c3  c?  +  g7  c23  +  g8  e22  <y 

(m  =  4,  v  =  6) 
■where  the  g's  are  as  yet  undetermined  numerical  coefficients. 

In  the  second  example  we  will  calculate  the  c/'s  for  the  case  »  =  3, 
for  which  therefore  c4  =  c5  =c6  =  0.  It  is  obvious  that  for  different 
values  of  n  the  coefficient  g's  will  be  different.     Taking 

I.     ,i\  =  1,  ar2  =  — ■  1,  a*3  =  0,   we  have   cl  =  0,  c2  —  —  1,  c3  =  0 

.-.  S  =  4  =  -g7;  ft  =  -4 

II.     a1!  =  a?2  =  1,  a3  =  0,  c:  =  2,  c2  =  1,  Cg  =  0 

•  ••   S  =  0  =  — 4  +  4g8;  g8  =  1. 

III.  a1!  =  a?2  =  1,  x3  =  —  1,  cl  =  0,  ftj  =  —  3,  fj  =  —  2 

.-.  S  =0  =  4&+4-27;  &  =  -- 27. 

IV.  Xl  =  x2  =  %  a-3  =  --l,  ^  =  3,  c2  =  0,  r-3  =  —  4 

.-.  S  =  0  =  —  27   16—  4-27g6;    g6  =  — 4. 
V.     aij  =  .r,  =  x3  =  1,  Cj  =  3,  c,  =  3,  e3  =  1 

. ' .  S  =  0  =  —  27  +  9g5  — 135;  q5  =  18, 

.  • .  (x1  —  x,y-(x,—x3y-(x3—x1y-  =  —  2~lr 

+  IS  Cg  Ca  C,  —  4c3  c,3  —  4fo:i  +  er  r,-. 


10  THEORY    OF     SUBSTITUTIONS. 

This  expression,  (.<•,  —  .<•_,)-'  (  .<•_.  —  .r,  )-' 1  xt  —  .'•,)"'  =  J,  is  called 
the  discriminant  of  the  quantities  .«-,,  x2,  .»•,.  The  characteristic 
property  of  this  discriminant  is  that  it  is  symmetric  and  that  its 
vanishing  is  the  sufficient  and  necessary  condition  that  at  least  two 
of  the  .rA's  are  equal. 

£  11.  In  general,  we  give  the  name  "discriminant  of  ti  quanti- 
ties .<•,,  x2,  .  .  .  ''."to  the  symmetric  function  of  the  X\B  the  van- 
ishing of  which  is  the  sufficient  and  necessary  condition  for  the 
equality  of  at  least  two  of  the  ,rA's  .  If  a  symmetric  function  S  of 
the  trA's  is  to  vanish  for  .r,  =  x2,  it  must  be  divisible  by  sCj  —  .«'_, , 
and  consequently  by  every  difference  xa  —  Xp .     Suppose 

o  —   y  .<"]  —  X2  )  '^1  • 

Now  S,  and  consequently  (as,  —  x2)  S{,  is  unchanged  if  a?,  and 
■  -■  lie  interchanged.  But  this  changes  the  sign  of  as, — x2  and  there- 
fore of  Si.  Consequently  S{  vanishes  if  ,x\  =  x2,  and  accordingly 
Sx  contains  .»-,  —  x2  as  a  factor. 

The  symmetric  function  S  is  therefore  divisible  by  (,x\  — 
and  consequently  by  every  (xa  —  ^3)";  that  is  it  is  divisible  by 

J  =  7T  (a*  ~  'V)2         (;-  <  !>■',  *  =  1,  2,  . .  .  n  -  -  1;  ;>.  =  2,  3,  .  .  .  n) 

Au 

=   ( .r,  .r_,j    ( .r,  #"3,)"  (.^1  -      -*'i  I  •  •  •  (  '''i  ■''„ ) 

(8)  ('.<•,  —  •'-,;  iJ  I  X.,         .r4  r.  .  .  i.e.         .«•„)-' 


(  ■''„  _  1  3C„)  • 

This  quantity  -J  already  satisfies  the  condition  as  to  the  equality 
of  the  X\8,  and,  being  the  simplest  function  with  this  property,  is 
itself  the  discriminant.  It  contains  .'  n  (n  -  1)  factors  of  the  form 
'  — .r^'f;  its  degree  is  )i  (n  —  1),  and  the  highest  power  to  which 
any  X\  occurs  is  the  (n  -l)th.  It  is  the  square  of  an  integral, 
but,  as  we  shall  presently  show,  unsymmetric  function,  with  which 
we  shall  hereafter  frequently  have  to  deal. 

£  12.  Finally  we  will  consider  another  symmetric  function  in 
which  the  discriminant  occurs  as  a  factor. 

Let  the  equation  of  which  the  roots  are  xu  x2,  .  .  .  x„  be,  as 
before,  f(x)  =  0.     Then  if  we  write 


SYMMETRIC    AND    TWO- VALUED    FUNCTIONS.  11 

we  have,  for  all  values  X  =  1,  2,  . . .  n,  the  equation 

f'(xK)  =  U'A  —  .»',)  (xx  —  a-,) . .  .  (j-a  —  .r.v_ ,)  (.rA  -         -,)...  (■'\  —  .<•„)• 
We  attempt  now  to  express  the  integral  symmetric  function 

Slxf  ./'(*,)  ./'(.-• ,)... /'(a--)] 
in  terms  of  the  coefficients  c,,  Co, .  .  .  c„  of  /  (.r),  Every  one  of  the 
n  terms  of  S  is  divisible  by  .r, —  x2,  since  either  / '(.»-,)  or/V-  | 
occurs  in  every  term.  Consequently,  by  the  same  reasoning  as  in 
§  11,  5  is  divisible  by  (xx  — a?2)2,  and  therefore  being  a  symmetric 
function,  by  every  (.».■„  —  Xp)2,  that  is  by 

-J  =TIVa     -  »K)a         (A  <  " ;    ^  =  1,  2,  .  .  .  n  —  1 ;  ac  =  2,  3,   .  .  .   »). 

Am 

S  is  therefore  divisible  by  the  discriminant  of  f{  '.»■),  /.  e.,  by  the  dis- 
criminant of  the  n  roots  of  /  (.<•). 

Now/(.rA)  is  of  degree  of  n  —  1  in  X\  and  of  degree  1  in  every 
other  x^\  and  therefore 

xia  •  /'O-')  •  /'(  vz)  ■  ■  •  /'(•*'..)  is  of  degree  a  +  n- —  1  in  .<-, 
■''/'  •  f'(xi)  ■  f'ixz)'  •  •  f'(xn)  is  of  degree         2n  —  3  in  .r, . 
Consequently,  if  a  <  n  —  1,  ,$'  is  of  degree  2  n  —  3  in  ,i\ ,  while 
J  is  of  degree  2  n  —  2  in  a\.     But  since  J  is   a  divisor  of  S,  it  fol- 
lows that  S  is  in  this  case  identically  0. 

(9)  S[.<r./'(.rJ)./'(.r;j).../'(.rJ]  =  0,  (a  <  n  —  1.) 

Again,  if  a  =  w  — - 1,  then  <S'  and  J  can  only  differ  by  a  constant 
factor.  To  determine  this  factor  we  note  that  the  first  term  of  S  is 
of  degree  2  n  —  2  in  r, ,  while  all  the  other  terms  are  of  lower 
degree  in  xt .     The  coefficient  of  .<y"  ~ 2  is  therefore 

(—  l)"^1(.r.  —  .<•.)  .  .  .  (.v,  —  x„)   (x3  —  .*•_.) .  .  .  (.«■..  —  .<■„)  .  .  . 

n(n-\\ 
(Xn—X2)...(xn  —  XH_1)  =  (—1)      2        (.V,  —  .«•.)'  I.  -■_.    —Xtf... 

(x«-i  —  •-->•„)-'. 

In  J  the  coefficient  of  ay" ~"  2  is 

(.»■_.       .<■)-'  (.»■_,  —  xty.  . .  (>„_,  —  x  r  . 

—j  > 
The  desired  numerical   factor  is  therefore  ( — 1)      ^~     and  we 
have 


12  THEORY    OF    SUBSTITUTIONS. 

(10)    s  [..■,•■-'.  /'(■•■■)•/'(■'■,).  ../'(*«)]  =  (- 

Formulas  (9)  and  (10)  evidently  still  hold  if  we  replace  a?i°  or 

a?, "  ~ '  by  any  integral   function  <f  ( .»•)  of  degree  «  .£  J  respectively. 

Moreover  since  ' 

n(n— t) 


(— 1)"T~J  =/'(.■,)./'(.,•.).../'(•»'..) 


we  have 
(D) 


A  =  )l 


^    -M'rA)    =  0  or  1* 

A=l 

according  as  the  degree  of  <p  is  less  than  or  equal  to  n  —  1. 

£  13.  If  an  integral  function  of  the  elements  .r, ,  x2,  .  .  .  xn  is 
not  symmetric,  it  will  be  changed  in  form,  and  consequently,  if 
the  X\B  are  entirely  independent,  also  in  value,  by  some  of  the  possi- 
ble interchanges  of  the  X\B.  The  process  of  effecting  such  an  inter- 
change we  shall  call  a  substitution.  Any  order  of  arrangement  of 
the  X\B  we  call  a  permutation.  The  substitutions  are  therefore 
operations:  the  permutations  the  result.  Any  substitution  whatever 
leaves  a  symmetric  function  unchanged  in  form ;  but  there  are  other 
functions  the  form  of  which  can  be  changed  by  substitutions.  For 
example,  the  functions 

12  2      I  2  9  2  .1  I  ft       I  ''       I 

/y»   * /v»   -    _L_      v    -  f    -  /v»      /v»   -    ^yi  I        rut      /v»       ,    1    ,     rtn  .■  1  t*    -    — —       ►  • 

•     1  '    j        |^    '    . ;  *    4  ?         *    1        2     *^ 3  1        j  i »  )  1  -  : 

take  new  values  if  certain  substitutions  be  applied  to  them:  thus  if 

a?,  and  x2  be  interchanged,  these  functions  become 

11  a\~  -j-  X2  -\-  j',---    ,r4  ,      X\  •''•'';  -p  •''-,•''-,  -~\~  •''>,»      ^''.>     i    **i   "i    •'    • 

The  first  two  functions  are  unchanged  if  .r,  and  x3  be  inter- 
changed, the  second  also  if  .»',  and  x5  be  interchanged,  etc. 

Functions  are  designated  as  one-  two-,  three-,  in-valued 
according  to  the  number  of  different  values  they  take  under  the 
operation  of  all  the  n !  possible  substitutions.  The  existence  of  one- 
valued  functions  was  apparent  at  the  outset.  "We  enquire  now  as 
to  the  possibility  of  the  existence  of  two-valued  functions. 

In  §  11  we  have  met  with  the  symmetric  function  J,  the  dis- 
criminant of  the  n  quantities  .*,,  x2,  .  ■  ■  ■''„■  The  square  root  of  J 
is  also  a  rational  integral  function  of  these  n  quantities: 

*The  formula  D  is  due  to  Euler;  C;ilc.  Inf.  IL  g  L169. 


SYMMETRIC    AND    TWO-VALUED    FUNCTIONS.  IS 

I  X  2  ■'' ,  )    I  ■''_•  ■''»  )  •   •   •  '  •' '.'  ■'  ..  ' 

I       C  ■'',    )...(•<';-  X        I 


Every  difference  of  two  elements  xa  —  .''p  occurs  once  and  only 
once  on  the  right  side  of  this  equation.  Accordingly  if  we  inter- 
chancre  the  X\8  in  any  way,  every  such  difference  still  occurs  once  and 
only  once,  and  the  only  possible  change  is  that  in  one  or  more  cases 
an  xa —  .('3  may  become  Xp — xa.  The  result  of  any  substitution 
is  therefore  either  +  s/  J  or  —  \/  J>  *•  <?.,  the  function  \/ J  is  either 
one-valued  or  two-valued.  But  if,  in  particular,  we  interchange  .»-, 
and  .<\ ,  the  first  factor  of  the  first  row  above  changes  its  sign,  while 
the  other  factors  of  the  first  row  are  converted  into  the  correspond- 
ing factors  of  the  second  row,  and  vice  versa.  No  change  occurs  in 
the  other  rows,  since  these  do  not  contain  either  .«-,  or  x2 .  Since 
then,  for  this  substitution,  s/  A  becomes  -  -  \/  J ,  it  appears  that  we 
have  in  \/-J  a  two-valued  function. 

This  function  is  specially  characterized  by  the  fact  that  its  tw7o 
values  only  differ  in  algebraic  sign.  Such  two- valued  functions  we 
shall  call  alternating  functions. 

Theorem  III.  The  square  root  of  the  discriminant  of  the  n 
quantities  -<\,  ■<■,,  .  .  .  x„  is  an  alternating  function  of  these  quanti- 
t  ■  s. 

$  14.  Before  we  can  determine  all  the  alternating  functions,  a 
short  digression  will  be  necessary. 

An  interchange  of  two  elements  we  shall  call  a  transposition. 
The  transposition  of  xa  and  .r6 ,  we  will  denote  by  the  symbol 
(xa  Cp).     We  shall  now  prove  the  following 

Theorem  IV.  Every  substitution  ran  be  replaced  by  a 
series  of  transpositions. 

Thus,  if   we  have  to  transform  the  order  xlf  •<'_>,  •''.,  •  .  .  •''„  into 
the   order    ,r(l,   .r,„,   a?f8,  . . .  x-,n,   we    apply  first   the   transposition 
(.c,  .  ,  ).     The  order  of  the  .rA's  then  becomes  .<•,-,,  .<•_, ,  .r:;,  .  .  .  x^  —  i 
.<•, .  .<•/,  + 1 ,  ...  x„ ,  and  we   have   now   only   to    convert   the    order 
.-■_,  .  .  .  .»',,  _  b  xu  X(j  +  i,  ...  x„  into  the  order  ..-,•_..  xis,  .  .  .  .<',„.      By 


14  THEORY    OF    SUBSTITUTIONS. 

repeating  the  same  process  as  before,  this  can  be  gradually  effected, 
and  the  theorem  is  proved. 

Since  a  symmetric  function  is  unaltered  by  any  substitution,  we 
obtain  as  a  direct  result 

Theorem  V.     A  function   which    is   unchanged   by   every 

transposition  is  symmetric. 

ij  15.     There    is    therefore    at    least    one    transposition    which 
changes  the  value  of  any  alternating  function   into  the   opposite 
value.     We  will  denote  this  transposition  by  (  xa  Xp)  ,  and  the  alter- 
nating function  by  4',  and  accordingly  we  have 
<!>{XX,X2,.  .  .  .<•„..  .  .  07/s,.  .  .  X„)=  —tp  (.r,,  ..■_,,  .  .  .  Xp,  .  .  .  Xa -    i 

Accordingly,  if  .*'a  =  Xp ,  we  must  have  4>  =  0.     Consequently  the 

equation 

4>  (x1}  x2,  ...  Z,  ...  Xp,  ...  x„)  =  0 

regarded  as  an  equation  in  z  has  a  root  z  =  Xp  and  the  polynomial 
4>  is  therefore  divisible  by  z  —  Xp .     The  function 

(p  (.r,,  ,»•,,,  .  .  .  xa  .  .  .  Xp  .  .  .  ■>■„) 

therefore  contains  xa  -  -  Xp  as  a  factor,  and,  consequently,  c' "  con- 
tains (xa  —  Xpf  as  a  factor. 

But  since,  for  all  substitutions,  <p  either  remains  unchanged  or 
only  changes  its  sign,  c'  "'  must  be  a  symmetric  function ;  and, 
accordingly,  since  d<-  contains  the  factor  (xa  -  Xp)2,  it  must  con- 
tain all  factors  of  the  form  (xK  —  x^f,  i.  e.,  ^''2  contains  J  as  a 
factor,  and  consequently  (p  contains  V-1  as  a  factor.  The  remain- 
ing factor  of  </'  is  determined  by  aid  of  the  following 

Theorem  VI.  Every  alternating  integral  function  is  of  the 
form  S.  V  J  ,  where  s/ A  is  the  square  root  of  the  discriminant  and 
S  is  an  integral  symmetric  function. 

That  S.  sf  A  is  an  alternating  function  is  obvious.  Conversely. 
if  4'  is  an  alternating  function,  it  is,  as  we  have  just  seen,  divisible 
by  V  J.  Let  (V-J  )"  be  the  highest  power  of  s/ A  which  occurs 
as  a  factor  in  0.     Then  the  quotient 

4> 


is  either  a  one-  or  a  two-valued  function,  since  every  substitution 


SYMMETRIC    AND    TWO-VALUED    FUNCTIONS.  15 

either  leaves  both  numerator  and  denominator  unchanged  or  changes 
the  sign  of  one  or  both  of  them.  But  this  quotient  cannot  be  two- 
valued,  for  then  it  would  be  again  divisible  by  s/  J  ,  which  is  con- 
trary to  hypothesis.  It  must  therefore  be  symmetric,  and  we  have 
accordingly 

Nowr  if  m  were  an  even  number,  the  right  member  of  this  equa- 
tion, and  consequently  the  left,  wrould  be  symmetric.  We  must 
therefore  have  m  =  2n  -f-  1.     And  if  we  write  Sl .  -I"  =  S.  we  have 

-f    ^   =  S  .  a/1 

Corollary.  From  the  form  of  an  alternating  function  it 
folloics  that  such  a  function  remains  unchanged  or  is  changed  in 
sign  simultaneously  with  s/ A  for  all  substitutions. 

§  16.  Having  now  shown  how  to  form  all  the  alternating  func- 
tions,  we  proceed  to  the  examination  of  the  two-valued  functions  in 
general. 

Let  cr  (•<',,  aj2j  .  .  .  x„)  be  any  two-valued  function,  and  let  the 
twTo  values  of  <p  be  denoted  by 

<fx{.x\,  .r,,  .  .  .  xn)     and     c'2(.c,,  ,v,,  . . .  x  I. 

These  two  functions  must  differ  in  form  as  well  as  in  value,  and 
since  the  trA's  are  any  arbitrary  quantities,  if  we  apply  to  9',  and  <p2 
any  substitution  whatever,  the  resulting  values 

( "■  I  fi  I  •'•/, ,  xk ,  .  .  .  .\'in )     and     c2  (xti ,  Xu , c,„ 

will  also  be  different.  But  whatever  substitutions  are  applied  to  c 
the  result  is  always  c,  or  cr, .  Consequently,  of  the  two  expressions 
(a),  one  must  be  identical  with  cr,  and  the  other  with  c , .  In  other 
words : 

Those  substitutions  which  leave  the  one  value  of  a  two-valued 
f miction  c  unchanged,  leave  the  other  value  unchanged  also;  those 
substitutions  which  convert  the  one  value  of  c  into  the  other,  also 
convert  the  second  value  into  the  first. 

§  17.  From  the  preceding  section  it  follows  at  once  that  cr,  -f-  c.2 
is  a  symmetric  function 

(,-')  *  +  f«  =  2$: 


16  THEOBY    OF    SUBSTITUTIONS. 

A  gain  the  difference  p,  -  v'.  is  a  two-valued  function  of  which 
the  second  value  is  cr_,  —  $r,  =  -  u-, — c,  \.  This  difference  is 
therefore  an  alternating  function,  and  accordingly,  from  Theorem 
VI,  we  may  write 

(r)  n,  —  Jpa  =  2  s,  V-J- 

From  (/S)  and  (f)  we  obtain. 

c,  =  5,  +  Sa  \/ J ,     c,  =  S,  —  S,  \/J,     <p  =  S,  ±  S2  y/1. 
Conversely,  it  is  plain  that  every  function  of  the  last  form  is 
two- valued. 

Theorem  VII.     Every  two-valued  integral  function  is  of 

the  form  c,  =  Sx  ±  S2  \/  J,  where  aS^  and  S2  are  integral  symmetric 
functions  and  \/J  is  the  square  root  of  the  discriminant.  Con- 
versely every  function  of  this  form  is  two-valued. 

Corollary.     Every  two-valued  integral  function  in  unchanged 

or  changed  simultaneously  with  \/  J  by  every  substitution. 

ij  13.  From  the  corollaries  of  the  last  two  theorems  we  recoe:- 
nize  the  importance  of  determining  those  substitutions  .which  leave 
the  value  of  V  J  unchanged. 

"We  know  (§13)  that  the  transposition  (•','_.)  changes  the  sign 
of  V  J.  In  the  arrangement  of  the  factors  of  V  J  in  the  same 
Section,  we  might  equally  well  have  placed  all  the  factors  containing 
xa  or  .rp  in  the  first  and  second  rows,  xa —  Xp  taking  the  place  of 
•<"i  —  •<*-■  j  etc.  The  sign  of  V  -J  may  be  changed  by  this  rearrange- 
ment, but  whatever  this  sign  may  be,  it  will  be  changed  by  the 
transposition  (xaXp).  Consequently  V  J 'changes  its  sign  for  every 
transposition. 

This  result  is  easily  extended.  For,  if  we  apply  successively 
any  ft  transpositions  to  V  J,  its  sign  will  be  changed  //.  times,  that  is 
VXJ  becomes  ( —  1)^  v^J.  If  /'  is  even,  \/J  is  unchanged;  if  p  is 
odd,  V-J  becomes — V-1-     We  have  therefore 

Theorem  VIII.  All  snhsfifu  ions  whirh  arc  formed  from 
an  odd  number  of  trans]>osili<»is  change  the  value  %/  J  into  — s/  A ; 
all  substitutions  which  are  formed  from  an  even  number  of  transpo- 
sitions leave  \/ A  unchanged.  Similar  results  hold  for  all  two- val- 
ued functions. 


SYMMETRIC    AND    TWO-VALUED    FUNCTION  3.  17 

£  L9.  Every  substitution  can  be  reduced  to  a  series  of  transpo- 
sitions in  a  great  variety  of  ways,  as  is  readily  seen,  and  as  will  be 
shown  in  detail  in  the  following  Chapter.  But  from  the  preceding 
theorem  it  follows  that  the  number  of  transpositions  into  which  a 
substitution  is  resolvable  is  always  even,  or  always  odd,  according  as 
the  substitution  leaves  \/  J  unchanged  or  changes  its  sign. 

Theorem  IX.  If  a  given  substitution  reduces  in  one  way  to 
an  even  (odd)  number  of  transpositions,  it  reduces  in  every  way  to 
an  even  (odd)  number  of  transpositions. 

§20.  Theorem  X.  Every  two-valued  function  is  the  root 
of  an  equation  of  the  second  degree  of  which  the  coefficients  are 
rational  symmetric  functions  of  the  elements  xu  U'2,  .  .  .  xn. 

From  the  equations  of  §  17, 

9l  =  St  +  S,  V J,      9a  =  'Si  —  S3  V4 
we  have  for  the  elementary  symmetric  functions  of  <ft  and  v., 

9\  +  fi  —  2£n 

G>2    CT2    =    S{   J  S-{ . 

We  recognize  at  once  that  ^  and  c._>  are  the  roots  of  the  equa- 
tion 

r  —  2  s,  9  +  (s;1  —  j  s.f)  =  o. 

It  is  however  to  be  observed  here  that  it  is  not  conversely  true 
that  every  quadratic  equation  with  symmetric  functions  of  the  X\8 
as  coefficients  has  two-valued  functions,  in  the  present  sense,  as 
roots.  It  is  further  necessary  that  the  roots  should  be  rational  in 
the  elements  X\ ,  and  this  is  not  in  general  the  case. 


CHAPTER   II. 


MULTIPLE-VALUED  FUNCTIONS  AND  GROUPS  OF 
SUBSTITUTIONS. 

§  21.  The  preliminary  explanations  of  the  preceding  Chapter 
enable  us  to  indicate  now  the  course  of  our  further  investiea- 
tions,  at  least  in  their  general  outline.  Exactly  as  we  have  treated 
one-valued  and  two-valued  functions  and  have  determined  those 
substitutions  which  leave  the  latter  class  of  functions  unchanged,  so 
we  shall  have  further,  either  to  establish  the  existence  of  functions 
having  any  prescribed  number  of  values,  or  to  demonstrate  their 
impossibility;  to  study  the  algebraic  form  of  these  functions;  to 
determine  the  complex  of  substitutions  which  leave  a  given  multiple- 
valued  function  unchanged;  and  to  ascertain  the  relations  of  the 
various  values  of  these  functions  to  one  another.  Further,  we  shall 
attempt  to  classify  the  multiple -valued  functions;  to  exhibit  them 
possibly,  like  the  two-valued  functions,  as  roots  of  equations  with 
symmetric  functions  of  the  elements  as  coefficients;  to  discover  the 
relations  between  functions  which  are  unchanged  by  the  same  sub- 
stitutions; and  so  on. 

§  22.  At  the  outset  it  is  necessary  to  devise  a  concise  notation 
for  the  expression  of  substitutions. 

Consider  a  rational  integral  function  of  the  n  independent  quan- 
tities .»•,,  .'•_,,  .  .  .  .«■„,  which  we  will  denote  by  <p  (.«•, ,  .»•_, ,  .  .  .  ,r„).  If 
in  this  expression  we  interchange  the  position  of  the  elements  xk  in 
such  a  way  that  for  xx ,  x., ,  ...  x„  we  put  x,^ ,  .r,., ,  .  .  .  ,r,  respectively, 
where  the  system  of  numbers  /,,  /._,,  .  .  .  /„  denotes  any  arbitrary  per- 
mutation of  the  numbers  1,  2,  ...  n,  we  obtain  from  the  original 
function  <p  ( .r,,  x,,,  .  .  .  x„ )  the  new  expression  <f  (.♦•,-, ,  .*••,,  .  .  .  x    ). 

We  consider  now  the  manner  of  representing  by  symbols  such  a 
transition  from  Xu  X1}  ...  xH  to  xi{,  x,-.,,  .  .  .  xin  ;  to  this  transition 
we  have  already  given  the  name  of  substitution. 


CORRELATION  OF  FUNCTIONS  AND  GROUPS. 


19 


A.     In  the  first  place  we  may  represent  this  substitution  by  the 
symbol 

'  X  , .  •'',..  •''.  !    •  •  •    ■'  ,„  J 1 

which  shall  indicate  that  every  element  of  the  upper  line  is  to  be 
replaced  by  the  element  of  the  lower  line  immediately  below  it.  In 
this  mode  of  writing  a  substitution  we  may  obviously,  without  loss, 
omit  all  those  elements  which  are  not  affected  by  the  substitution, 
that  is  all  those  for  which  xk  =  xik .  In  the  latter  case  the  entire 
number  of  elements  is  not  known  from  the  symbol,  but  must  be 
otherwise  given,  as  is  also  true  in  the  case  of  <p  itself,  since,  for 
example,  it  is  not  in  any  way  apparent  from  the  form  of 

whether  other  elements  .«'- ,  xti,  ...  may  not  also  be  under  consider- 
ation, as  well  as  those  which  appear  in  (f. 

B.  Secondly,  we  may  make  use  of  the  result  of  the  preceding 
Chapter,  that  every  substitution  can  be  resolved  into  a  series  of 
transpositions.  If  we  denote  such  a  transposition,  i.  e.,  the  inter- 
change of  two  elements,  by  enclosing  both  in  a  parenthesis,  every 
substitution  may  be  written  as  a  series 

[Xa^b)  \XeXg)    ■  .  .    \XpXqj. 

This  reduction  can  be  accomplished  in  an  endless  variety  of 
ways.  For,  as  is  shown  in  §  14  of  the  preceding  Chapter,  we  can 
first  bring  any  arbitrary  element  to  its  proper  place,  and  then  pro- 
ceed with  the  remaining  n--l  elements  in  the  same  way.  Indeed 
we  may  introduce  any  arbitrary  transposition  into  the  series  and  can- 
cel its  effect  by  one  or  more  later  transpositions,  which  need  not 
immediately  follow  it  or  each  other. 

C.     Thirdly,  we  may  also  write  every  substitution  in  the  form 

Here  each  parenthesis  indicates  that  every  element  contained 
in  it  except  the  last  is  to  be  replaced  by  the  next  succeeding,  the  last 
element  being  replaced  by  the  first.  The  parentheses  are  called 
cycles,  the  elements  contained  in  each  of  them  being  regarded  as 
forming  a  closed  system,  as  if  they  were,  for  example,  arranged  in 
order  of  succession  on  the  circumference  of  a  circle. 


20  THE0B7    01    BUB8TITUTION8. 

0 

If  aw  wish  to  pass  from  the  notation  A  to  the  present  one,  the 
resulting  cycles  would  read 

'•'  ...)(.'■•'     •''...) 

Here  too  it  is  clear  that  those  elements  which  are  unaffected  by 
the  substitution,  every  one  of  which  therefore  forms  a  cycle  by 
itself,  may  be  omitted  in  the  symbol.  In  the  notation  A  these  ele- 
ments are  the  same  as  those  immediately  below  them. 

A  fourth  system  of  notation  which  is  indispensable  in  many 
important  special  cases  will  be  discussed  later. 

§  'J:i  It  is  obvious  that  each  of  the  three  notations,  A,  B,  and  C, 
contains  some  arbitrary  features.  In  A  the  order  of  arrangement 
of  the  elements  in  the  first  line  is  entirely  arbitrary;  in  B  the 
reduction  to  transpositions  is  possible  in  a  great  number  of  ways;  in 
C  the  order  of  succession  of  the  cycles,  and  again  the  first  element 
of  each  cycle,  may  be  taken  arbitrarily. 

The  first  of  the  three  notations,  in  spite  of  its  apparent  sim- 
plicity lacks  in  clearness  of  presentation ;  the  second  is  defective,  in 
that  the  same  element  may  occur  any  number  of  times,  so  that  the 
important  question,  "by  which  element  is  a  given  element  replaced," 
cannot  be  decided  at  first  glance,  and  the  equality  of  the  two  sub- 
stitutions is  not  immediately  clear  from  their  symbols.  We  shall, 
therefore,  in  the  following  investigations,  employ  almost  exclusively 
the  representation  of  substitutions  by  cycles. 

The  following  example,  for  the  case  n  =  7,  will  serve  as  an  illus- 
tration of  the  different  notations. 

It  is  required  that  the  order  .c,  ,  .»■_, ,  .<■..  ./..  .<   ,   i,  ,  .,■-  shall  be 
replaced  by  the  order  .<-.,,  .c7,  .<•-,  xt,,  .<■,,  .«■„,  .<.. 
The  first  method  gives  us 

/  fl*l   X%  %3  *^4  "^5  *^"«  *^7  \    .         /   •'  i     '  j  -^3  «**5  "^*;    1 

I        ,  •  ,  •  .  •        /y»        rtn        rv*  .  <        I  1      sy        rv%        /y»         ™        ™        I 

:        ,    ■    \        1    'I        1 1   ' *  2  J  ;        ;    ■     ,   • '  1    ■ '  2  J  • 

By  the  second  we  have  variously 

(ajjSCg)  (.'VI  '-'Vt)  =  (j?i«s)  (#i#5)   <•'•  ■•'■  I  <-<V;>  f'V^) 
=  {.r,.vt)  (a-5X6)  (x,.r;)  i.r..c-)  (.,•,.-„)  (.r_,.r7)  (.r,..-,)  (.<•,.,•,)  (.,■„.■  , 


Since  the  given  substitution  resolves  into  3,  5,  9,  ... ,  transposi- 
tions, always  an  odd  number,  we  have  here  an  example  of  the  prin- 


CORRELATION  OF  FUNCTIONS  AND  GROUPS.  21 

ciple  of   Chapter   I,  §  19,   and   it   appears   that   this    substitution 
changes  the  sign  of    \/  J. 
The  third  method  gives  us 

§  24.  We  determine  now  the  number  of  all  the  possible  substi- 
tutions by  finding  the  entire  number  of  possible  permutations. 

Two  elements  .»', ,  x2i  can  form  two  different  permutations,  .»-,.»• , 
and  .)'„/', .  If  a  third  element  xs  be  added  to  these  two,  it  can  be 
placed,  1)  at  the  beginning  of  the  permutations  already  present 
.c..i\.r,,  .(■..(•,.*■,,  or  2)  in  the  middle:  ■fl.r:i.r,,  .''..'•..•<",,  or  3)  at  the 
end:  .r,.r_,.r,,  .r  .r,.c. .  There  are  therefore  2-3  =  3!  permutations 
of  three  elements.  If  a  fourth  element  be  added,  it  can  occur  in 
the  first,  second,  third  or  fourth  place  of  the  3 !  permutations  already 
obtained,  so  that  from  every  one  of  these  proceed  4  new  permuta- 
tions. There  are  therefore  in  this  case  2-3-4  =  4!  permutations, 
and  again,  for  5  elements,  5!,  in  general,  for  n  elements,  ;;!  permu- 
tations. 

If  now,  in  the  notation  A,  we  take  for  the  upper  line  the  natural 
order  of  the  elements,  .v,.  .<•_.,  x ..,  .  .  .  x„,  and  for  the  lower  line  suc- 
cessively all  the  n !  possible  permutations,  we  obtain  all  the  possible 
distinct  substitutions  of  the  n  elements. 

It  is  to  be  noticed  that  among  these  there  is  contained  that  sub- 
stition  for  which  the  upper  and  lower  lines  are  identical.  This 
substitution  does  not  affect  any  element;  it  is  denoted  by  1.  and 
regarded  asunity  or  as  the  identical  substitution. 

Theorem  I.  For  n  elements  there  are  n\  possible  substitu- 
tions. 

To  obtain  the  same  result  from  the  notation  B  more  elaborate 
investigations  would  be  necessary  for  which  this  is  not  the  place:  in 
case  of  the  notation  C  it  is  easy  to  establish  the  number  it !  by  the 
aid  of  induction. 

AVe  arrive  in  the  latter  case  at  a  series  of  interesting  relations, 
of  which  at  least  one  may  be  noted  here.  If  a  substitution  in  the 
expression  for  which  all  the  elements  occur  contains 

a  cycles  of  a  elements,  b  cycles  of  ,5  elements, 


22  THEORY    OF    SUBSTITUTIONS. 

where  aa  +  6]J+  ...  =n,  N I 

we  can  obtain  from  this  by  rearrangement  of  the  order  of  the  cycles 
and  by  cyclical  permutation  of  the  elements  of  each  single  cycle 

a!  a"  \>\jh  .  .  . 

expressions  for  the  same  substitution.     Consequently  there  are 

n! 


a!  aa  b\  p  .  .  . 

distinct  substitutions  which  contain  a  cycles  of  a  elements,  b  cycles 
of  /3  elements,  and  so  on.  The  summation  of  these  numbers  with 
respect  to  all  possible  modes,  N),  of  distributing  the  number  n  gives 
us  all  the  possible  n !  substitutions.     Hence 

'^ 1 _-.    * 

£  25.     If  now  we  apply  all  the  n\  substitutions  to  the  function 

<p  (•'•,,  ■•■■ '■„).   i.  e.,  if  we  perform  these   substitutions,  which 

may  be  denoted  by 

•S'l  =    1,  S_, ,  S:i,    .  .  .  Sa,   ...   .s'„-. 

among  the  .<•,,  x2,  .  .  .  jc„  in  the  expression  e,  we  obtain  >i\  expres- 
sions, including  that  produced  by  the  substitution  s,  =  1.  These 
expressions  we  may  denote  by 

9^  =  9l,    9*,,   9s3   ■  ■  ■   9ea   ■  ■   ■   f       • 

or  simply,  where  no  confusion  is  likely  to  occur,  by 

9\,  9i,  9z,   •  •  •  9a,  •  •  •  9n- 

These  values  are  not  necessarily  all  different  from  one  another. 
Some  of  them  may  coincide  with  the  original  value  f  ('.<•, ,  .r,,  .  .  .  xn). 
We  direct  our  attention  at  first  to  the  complex  of  those  substitu- 
tions which  do  not  change  the  value  of  c.  If  <p  is  symmetric 
this  complex  will  comprise  all  the  n\  substitutions;  if  <s  is  a  two- 
valued  function,  the  complex  will  contain  all  substitutions  which 
are  composed  of  an  even  number  of  transpositions,  and  only  these. 

Again,  for  example,  consider  the  case  of  four  elements  ./,,  x .,  ■  >'.,  r„ 
and  suppose 


*Cauchy:  Exercices  d'analyse,  III.  17.;. 


CORRELATION  OF  FUNCTIONS  AND  GROUPS.  23 

i 

This  function  is  unchanged  by  8  of  the  possible  24  substitutions, 
namely  by 

S[  - —  1,       S_.  --  (XiSCqff       S:i  —  (QCzXiJ)       St  —  (iT,X_>j  (.('..*',), 
S-f  —   \  tA  ]•'  jU    VCa  ),        Sq   —  I  JC^JC^JC^JC^ I,        o-j  —  I ■'  [<a     i   I  •'   |w  j ), 

By  the  remaining  4!  —  8  =  16  substitutions   w   is  changed,  and,  in 
fact,  is  converted  into  either 

We  note  then,  in  passing,  that  we  have  found  here  a  three-valued 
function  of  four  elements  which  is  unchanged  by  8  of  the  24  possi- 
ble substitutions  of  the  latter. 

§  26.  Those  substitutions  which  leave  a  function  <p  (.<-, ,  .<■, , .  .  .  x„) 
unchanged,  the  number  of  which  we  shall  always  denote  by  r,  we 
shall  indicate  by 

It)  Sj  —  J.,  So,  S3,    •  •  •  S,.  5 

Sj  =  1  is  of  course  contained  among  them.     Following  the  notation 
of  the  preceding  Section  we  have  then 

<P  =  9%  =  9i  =  9»,  —  •  •  •  =  ?.->• 

By  supposition  there  is  no  substitution  s'  different  from 
s^s.^s,,  ...  s, ,  which  leaves  the  value  of  <p  unchanged;  i,  e.,  we 
have  always 

fV=j=P,     if  s'=fsA      (/  =  1,  2,  3,  . ..  r). 

If  now  we  apply  two  substitutions  sa,  Sp  of  our  series  su  s2, . . .  s,. 
successively  to  <p,  and  denote  the  result,  as  above  in  the  case  of  a 
single  substitution  by  <p„a  sg ,  then  since  <pSa  =  <p ,  the  result  of  the 
two  operations  will  be 


<-". 


(?0*fl  =  9.B  =   <P\ 


a  -0  —   \rsaJsp   ~   ftp 

and  from  this  we  conclude  that  saSp  also  occurs  in  the  above  series 
G).  Every  substitution  therefore  which  is  produced  by  the  succes- 
sive application  of  two  substitutions  of  G)  occurs  itself  in  G). 
What  is  true  of  two  substitutions  of  the  series  is  further  clearly 
true  for  any  number  whatever. 

The  substitution  which  results  from  the  successive  application  of 
two  or  more  substitutions  we  call  their  product,  and  we  write  the 


24  THEORY    OF     SUBSTITUTIONS. 

« 

substitution  a  which  produces  the  same  effect  ou  the  order  of  the 
elements  ./  ,  .<•  ....  x„  as  the  successive  application  of  sa  and  Sp, 
as  the  product  a  —  sa  sp. 

The  product  of  any  number  of  the  operations  s  occurs  again  in 

the  s<ri>>s  (?)  sn  s2,  s8,  .  .  .  sr  .  The  succession  of  the  operations  in 
a  product  •-  =  saSpsy  .  .  .  is  to  be  reckoned  from  left  to  right. 

§  27.     The  expression  of  such  a  product  in  the  cycle  notation 
which  we  have  adopted  is  obtained  as  follows: 
If  the  two  factors  of  a  product  are 

Sa    (•'       ■•'    !    ■'',,.,    .    .    .    )    (•''/.   .''/,   •''       ...)..., 

sp  =  (x,  x    aiftj  ...)!.'•  .'■    •''...)..., 

then  in  saSp  that  element  will  follow  xa  by  which  Sp  replaces  a •„,. 
Suppose,  for  instance,  that  this  element  is  x,,x .  Again  in  sa  Sp  that 
element  will  follow  xhi  by  which  Sp  replaces  .*■„., .  Let  this  be  for 
example,  xki ,  etc.     We  obtain 

s0S/3  =  (cca  a?7l j  aVo  •  •  ■  ) 

If  the  substitution  sa  be  such  that  it  replaces  every  index  g  of 
the  elements  a;, ,  x2,  . .  .  xg,  ...  .»',,,  by  /„,  and  if  sp  be  such  that  it 
replaces  every  index  g  by  k,n  or,  in  formulae,  if 

sp  =  (x1xklxkhi  .  .  .  )  (xbxkb.  .  .  )  .  .  .. 
then  the  product  will  be  of  the  form 

SaSp   =   faXj^    ...)     I.r     .r         ...)... 

The  following  may  serve  as  an  example: 

8a    ~      '■''  ■'';•'': .)    '-''j-'';)}        Sp  -      l.'\.<'(.f,  |    (.''.'■). 

Sa  .s^j  =  (.r,.r  )  I.  '■,.(•-.  '•,./',, )  (.*'.)         (.»■..'', I  I'    '•   I'.''.  I. 

W'fhave  introduced  here  the  expression  "product."  The  ques- 
tion now  arises  how  far  the  fundamental  rules  of  algebraic  multipli- 
cation 

a  •  b  —  b  •  a,     a  •  (b  •  c)    -  (a  •  6)  •  c 

remain  valid  in  this  case.  An  examination  of  this  matter  will  show 
that  the  former,  the  commutative  law,  in  general  fails,  while  the 
second,  the  associative  law,  is  retained.    In  fact  the  multiplication  of 


CORRELATION    OF    FUNCTIONS    AND    GROUPS.  25 

Sa  =  ( .<',  ■'.,  •'•„,   ...)••.,      Sp  =  (.*'!  »*,  0?fct]  ...)..., 

as  performed  above  shows  that  it  is  only  in  the  special  case  where, 
for  every  a  ,  ik  =  k,a ,  that  the  order  of  the  two  factors  sa  and  s$  is 
indifferent.  This  occurs,  for  example,  as  is  a  priori  clear,  if  the 
expressions  for  s„  and  s$  contain  no  common  elements. 

We  may  therefore  interchange  the  individual  cycles  of  a  substi- 
tution in  any  way,  since  these  contain  no  common  elements.  In 
the  notation  I?  of  page  19,  on  the  other  hand,  this  is  not  allowable. 

Passing  to  the  associative  law,  however,  if 

8a=(xs  Xu )  .  .  . ,    8p  =  (xs  Xks )  .  .  . ,    Sy  =  {xjCh  ...)..., 

we  have  the  following  series  of  products, 

Sp  Sy  =  (Xs  Xlhs    ...)...,  Sa8p  =  X8  Xk.a  ...)••  • 

««  (Sj3  Sy  )  =  (xsXlk.a  ...)...,  (saSf})Sy=  {xsXlkia  ...)..., 

from  which  follows 

Theorem  II.  In  the  multiplication  of  substitutions  a  col- 
lection of  the  factors  into  sab -products  without  change  in  the  order 
of  the  factors,  is  permissible.  An  interchange  of  the  factors,  on 
the  contrary,  generally  alters  the  result.  Such  an  interchange  is 
however  permissible  if  the  factors  contain  no  common  elements. 

§  28.  From  the  preceding  developments  it  appears  that  those 
substitutions 

Lr)  Sx  =  1 ,  Sj ,  s3 ,  .  .  .  sa ,  .  .  .  s,. 

which  leave  a  given  function  <p  (•<',, -n,  .  .  .  x„)  unchanged,  form  a 
closed  group  in  this  respect,  that  the  multiplicative  combination  of 
its  substitutions  with  one  another  leads  only  to  operations  already 
contained  in  the  group. 

The  name  "group"  *  we  shall  always  use  to  denote  a  system  of 
substitutions  which  possesses  this  characteristic  property  of  repro- 
ducing itself  by  multiplication  of  its  individual  members.  The 
number  of  elements  operated  on  is  called  the  degree  of  the  group. 
It  is  not  however  necessary  that  all  the  elements  should  actually 
occur  in  the  cycles  of  the  substitutions.     Thus 

•Cauchy,  who  gave  the  first  systematic  presentation  of  the  Theory  of  Substitutions 
in  the  Exerciees  d' Analyse  et  de  Physique  Mathematique,  employs  the  name  "  system  of 
conjugate  substitutions."  Serret  retains  this  name  in  his  Algebra.  The  shorter  name. 
'•  group,"  was  introduced  by  Galois. 


26  THEORY    OF    SUBSTITUTIONS. 

s,  =  1,  s2=  (.<•,.<•_.)  I.-.,,) 

form  a  group,  for  we  have  s,  .s,  =  s.sl  —  s2,  s.,s.,  ==  s,  =  1.  This 
group  is  of  degree  4,  if  only  the  elements  xt ,  .<•_, ,  .<•.,,  ,r,  be  under 
consideration.  But  we  might  also  regard  the  group  as  affecting,  for 
example,  6  elements  .r, ,  .«\ ,  .  .  .  .<■„,  in  which  case  we  may,  if  desired, 

write  for  s2 

,;.'  =  (.»■,.»■.)  (a ■,.- ,)  (.<•-,)(.,-.  I. 

The  degree  of  the  group  is  then  6. 

The  number  of  substitutions  contained  in  a  group  is  called  its 
order;  as  already  stated,  this  number  will  always  be  denoted  by  r. 

The  entire  system  of  substitutions  which  leave  the  value  of  a 
function  y  ('.»•, ,  x2,  .  .  .  .r„)  unchanged  is  called  the  group  of  substi- 
tutions belonging  to  the  function  y,  or,  more  briefly,  the  group  of 
c.  The  degree  of  the  group  expresses  the  number  of  elements 
.'-,,  .<•_,,  .  .  .  x„  under  consideration;  its  order  gives  the  number  of 
substitutions  which  leaves  the  function  <p  unchanged. 

Thus,  given  the  four  elements  .x\,  x2,  x3,  xt,  and  the  function 

c  =  x,X,  +  XsXt, 
the  degree  of  the  group  belonging  to  y  is  4;  its  order,  as  shown  in 
§  25,  is  8. 

For  the  five  elements  .r, ,  x2,  xa,  xt,  x5,  the  same  function  <p  has 
a  group  of  degree  5  and  of  order  8,  identical  with  the  preceding 
one. 

For  the  six  elements  x} ,  x2,  x3,  .  .  .  xti,  the  same  yhas  a  group  of 
degree  6.     To  the  group  above  we  must  now  add  all  those  substitu- 
tions which  arise  from  combining  the  former  with  the  interchange  of 
-    and  -   .    The  group  now  contains  beside  the  eight  substitutions  of 
§  25  the  following  eight  new  ones: 

Sr,  =  (•♦'-/'V,)j      Sw  =  (.»',.<'.,)  [X  -,•<',),      sn  —  {.r..rl)  I. r  .r,), 

S\>  =  (xvx'j)  (•*■.;•''.)(•''-,■'',,),     Sja  r     (.<•,. r..'\.r,)  ( -'",•'■,, ),    *!( —  ( .*•,.<■,.<•  ..f . )  ( ■''y.Etijj 

•s'i:,  =  ('V'';)  '''j-''|l  '•'',■''.,),      S10  =  yXiXt)  (.<\.r.)  I.r.r,  ). 

The  order  of  the  group  of  <p  is  therefore  now  8  •  2  =  16. 

It  is  easy  to  see  that  if  we  regard  <?  as  dependent  on  n>  4  ele- 
ments, the  order  of  the  corresponding  group  becomes  8  •  (n  -  1 ) !  , 
the  group  being  obtained  by  multiplying  the  8  substitutions  of  §  25 
by  all  the  substitutions  of  the  elements  .«■-,  .«•„ ,  ...  x   , 


CORRELATION  OF  FUNCTIONS  AND  GROUPS.  27 

§  29.     The  following  theorem  is  obviously  true : 

Theorem  III.  For  every  single- or  multiple-valued  func- 
tion there  is  a  group  of  substitutions  which,  (implied  to  thefunctionr 
leave  it  unchanged. 

To  show  the  perfect  correlation  of  the  theory  of  multiple-valued 
functions  and  that  of  groups  of  substitutions  we  will  demonstrate 
the  converse  theorem : 

Theorem  IV.  For  every  group  of  substitutions  there  are 
functions  which  arc  unchanged  by  all  the  substitutions  of  the  group 
and  by  no  others. 

We  begin  by  constructing  a  function  <p  of  the  n  independent 
elements  ,r,,  .r2,  .  .  .  xn  which  shall  take  the  greatest  possible  num- 
ber of  values,  viz :  n  ! ;  <f  is  therefore  to  be  changed  in  value  by  the 
application  of  every  substitution  different  from  unity. 

Taking  n  -\-  1  arbitrary  and  different  constants  <z0,  al5  ...  a„,  we 
form  the  linear  expression 

c  —  a0  -f-  «!  x\  +  «..+  •••+  "■,.  ■>■., 

If  now  two  substitutions  sa=(av<\v ...)...  and  s^=(«r.fa,A.x.  ..)..., 

on  being  applied  to  cr,  gave  the  same  result,  we  should  have 

0  =  <p3a  —  <Pafi  =  ",0\.  —  xh)  +  a2(xk  —  xkj  + 

But  the  «A's  being  arbitrary  quantities,  this  equation  can  only  be 
satisfied  if  each  parenthesis  vanishes  separately  (§  2,  C),  that  is  we 
must  have  <  =.x\.  But,  if  this  be  the  case,  since  the  X\S  are  also 
independent  quantities,  the  two  substitutions  sa  and  s$  both  replace 
every  X\  by  the  same  element  Xix  =  .ck.A,  so  that  sa  and  Sp  are  identi- 
cally the  same.  It  is  only  in  this  case,  where  sa  and  s$  are  identical, 
that  they  can  produce  from  <p  the  same  value.  Accordingly  <p  has  n  ! 
distinct  values. 

§  30.  If  now  a  group  G  be  given,  composed  of  the  substitu- 
tions 

8\  =  1)    Ss,    S3,     ...     Sa,     ...     S,., 

which  we  will  indicate  symbolically  by  the  equation 

G—  [«,,  s,,  s3  ...  sa,  .  .  .  s,.], 
we  apply  all  the  substitutions  of  G  to  the  n!- valued  function  with 
n  -f-  1  parameters 


28  THEORY    OF   SUBSTITUTIONS. 

9  =  ao  +  "\  -'"i  +  "ixi  +...+«,  ■'•.  • 
and  denote  the  results  of  these  operations  as  before   by  correspond- 
ing subscripts  attached  to  the  9  "- 

¥*  =  9u  <f\i  V.   •  •  •  *V 
Then  the  product  of  these  functions  95 

^  —  Vt   ■  £".-■..  •  ¥.-  •  •  •  V 
will  be  one  of  the  functions  to  which  the  group  of  substitutions  G 
belongs. 

To  prove  this  it  must  be  shown  1)  that  cr  is  unchanged  by  every 
substitution  a  of  G,  and  2)  that  fP  is  changed  in  value  by  every 
substitution  r  which  does  not  occur  in  G. 

In  regard  to  the  first  condition  we  have 

* cr  —  r.-i<r       V  -~<t       V  -  tx   ■  •  •    V  .-,  en 

and,  from  the  definition  of  a  group,  sxa  =  cr,  s.v,  s.v.  .  .  .  sra  are  again 
contained  in  G.  Moreover,  these  products  are  all  different  from  one 
another;  for  if  sa<r  and  s^v  applied  to  99  have  the  same  effect,  this 
must  also  be  the  case  with  sa  and  s$  alone,  and  therefore  sa  and  s$ 
are  identical.  Accordingly  the  substitutions  sxt  =  <t,  s2<r,  s :  *.  ...  8r<r 
are  identical,  apart  from  their  order,  with  s,  =  1,  s,,  s8,  .  .  .  s,..  and 
hence  the  functions 


c          c          c 

. .  ',-  „ 

are  identical  with 

C            C           C 

and  accordingly 

0>  =  * 

as  was  asserted. 

As  to  the  second  condition,  the  substitutions  *,r,  *-.  g8r, .  .  .  srr 
are  all  different  from  *,,  s2,  s:! ,  ...  s,.,  and  consequently  the  func- 
tions <  T.  >  :.  c  ..  .  .  .  cr.  T  are  all  different  from,  the  factors 
•-'    .  .  ■  •  •  f,,.  of  'I'.     Moreover,  this  difference  is  such  that  no 

c-  -  can  be  equal  to  the  product  of  a  <-    by  a  constant  r, ,  in  which 
case 

<pr  =  ?v9*r  •  •  ■  «V  =  <\  C2CB  .  .  .  c,.cS]c^c^    .  .  .  <p,r 
would  become  equal  to  'I'  if  <•  c  c8  .  .  .  c,    -   1.     For,  if 

%  +  «i  »n"+  «,.-«Y.  +  •  •  •  =  c((a0  +  aI(T/i  -f  «,.,',2  -f  .  .  .  ,. 


CORRELATION    OF    FUNCTIONS    AND    GBOUPS.  29 

then,  since  the  a^s  are  arbitrary  quantities,  it  would  follow  at  once 

that 

r,  =  1, 

and  consequently  we  should  have  the  impossible  equation  crT  =  <p 

^  31.  In  many  cases  the  calculation  of  <l>  is  impracticable,  since 
the  multiplication  soon  becomes  unmanageable  even  for  moderately 
large  values  of  r.  There  is  however,  another  process  of  construc- 
tion in  which  the  product  is  replaced  by  a  sum,  and  every  difficulty 
of  calculation  is  removed. 

We  begin  by  taking  as  the  basis  for  further  construction,  instead 
of  the  linear  function  c,  the  following  function 

V  (.<•,,. r.,..-:!,  .  .  .  .r„)  =  x^xpxp  .  .  .  .<•„%. 

The  ap's  are  to  be  regarded  here,  as  before,  as  arbitrary  quanti- 
ties, and,  as  the  ,rA's  are  also  arbitrary,  it  follows  at  once  that  <p  is 
an  w!- valued  function.     For,  if 

then  we  must  have  identically 

.»V8i.r./2.c,S;!  .  .  .  xfn  =  x,"aV2.r::«  .  .  .  .<■,;/», 

and,  from  §  2,  C,  this  is  only  possible  if  every  ,5,  is  equal  to  the  cor- 
responding Yn  that  is,  if  the  substitutions  <r  and  r  are  identical. 

We  denote  the  functions  which  proceed  from  </'  under  the  opera 
tion  of  the  substitutions  of  G  by 

T«]    V   1  <    V  So 5    V  .-.;•••    "r  ,,. 

and  form  now  the  sum 

v=4>n  +  <I>H  +  K  +  ■■■  +K- 

The  proof  of  the  correlation  of  G  and  ip  proceeds  then  exactly  as 
in  the  preceding  Section  in  the  case  of  G  and  (P. 

Remark. — By  making  certain  assumptions  with  respect  to  the 
a's  we  can  assign  to  the  v'''s  some  new  properties.  Thus  we  may 
select  the  a's  in  such  a  way  that  an  equation  between  any  two  arbi- 
trary systems  of  the  a's, 

«,-x  +  "/,  +  ■  •  •  «;A  =  «*,  +  «/,,  +  •  ■  •  «^ , 

necessarily  involves  the  equality  of  the  separate  terms  on  the  right 
and  left.     This  condition  is  satisfied  if,  for  example,  we  take 


30  THEORY    OF    SUBSTITUTIONS. 

a,  >  «, ,     «:i  >  a,  +  a., ,      «4  >  «,  -(-  a2  -J-  a, , , 

in  particular  if 

atj  =  1,     Wo  =  2,     «:j  =4,     a4  =  8,     «-,  =  10,  .... 
E.  g.    If  a,-,  -f-  a,.,  -f-  .  .  .  -f  «,A  =  13,   we   must   have   i\  =  1,   i,  =  3, 
*3  =  4,     X  =  3. 

Example. — We  will  apply  the  two  methods  given  above  to  the 
familiar  group 

G  =  [l,   Ov*',.),    (a?aa?4),    (ayr,)  (x^4),   (.r,x3)  (a-,.'-, ,,    (a ■,.«■»  |  (avB8), 

(.!•,. JVC..*-.),    (.»■,.»■,.»•...«•..)],  (  n  =  4,  V  =  8) 

taking  as  fundamental  functions 

c  —  Xl-\-  ix2  —  x3  —  ia\  and   4'  —  •>'\"'>\'  ' 


where,  as  usual,  i  =  V — 1. 

We  have  then  the  following  results: 
<1>  =    (.r,  +  /..•,  —  xs — ix4)  (.r.,  +  ixx — x3 —  ijc4)  (a1,  +  It., — .<•,       ix3) 
<•'".■  +  '-''i — Xi—iXa)  (ops  +  iXi  —  .*-,—  *.»■,)  (.1-,  +  /.(•;  —  x%  —  /.*-,) 
(xz-\-  /.'•, — x2 — ixx)  {Xi,-\-ix3  —  Xj  —  /.r_,) 
=  [(.r,  +  ixz — x3 — ixt)  (x2Jt-ix1—x3—ix^  (xL-\-ix2 — xA —  ix3) 

(•'•:+  KB] Xt lXs)~f 

=  { [(«!— xtf  +  ix,— xt)*]  l{xl-xi)2  +  {x2—xif]  }\ 

W  =  .,•_..,-  .,■?  +  x1x32xi3  +  avr4V  +  a^V  +  a^V  +  ■'•  ■<;  x 

=  (ajj  +  as,)  (xfxf  +  xM  +  fa  +  xd  («iV  +  »»V) 

=  (a^  +  .'-J  (•'■    !  x^{x3x?  +  x?x22). 
Neither  of  the  two  methods  furnishes  simple  results  directly. 
But  from  'I'  we  may  pass  at  once  to  the  function 

[(.<-,  —  Xi  f  +  (£c8 — x4 )-]  [(«,  —  *4)a  +  (x2  —  .!•:; )-] . 
and  from  '/'to  the  two  functions 

(.!■,  +.r,  )(.(■. -)-.(-,)     and     .(■,.!■_.  +  .  r,-',, 

the  latter  being  already  known  to  us.  It  is  clear  also  that  by  alter- 
ing the  exponents  which  occur  in  W  we  can  obtain  a  series  of  func- 
tions all  of  which  belong  to  G.  Among  these  are  included  all 
functions  of  the  form 

(.-y  +  x2" I  (aV  +  <*-*) .     a\a «%a  +  •«•.;" ■''"■ 


CORRELATION  OF  FUNCTIONS  AND  GROUPS. 


31 


In  general  we  perceive  that  to  every  group  of  substitutions  there 
belong  an  infinite  number  of  functions. 

It  may  be  observed  however  that  we  cannot  obtain  all  functions 
belonging  to  a  given  group  by  the  present  methods.  Thus  the 
function 

belongs  to  the  group 

G  =  [1,  (.'■,..-,),  (.»■,.<•,!,  (.<■,.,•_.)  ('■;.'■,)], 

but  cannot  be  obtained  by  these  methods.  More  generally,  if 
the  functions  c''',  0",  c""',  .  .  .  belong  respectively  to  the  groups 
H',  H",  H'",  .  .  .  ,  and  if  the  substitutions  common  to  these  groups 
(Cf.  §  44,  Theorem  VII)  form  the  given  group  G,  then  the  function 

where  the  a's  are  arbitrary,  belongs  to  the  group  G. 

§  32.     We  now  proceed  to  consider  the  case  where  the  elements 
xx ,  x2 ,  . .  .  x„  are  no  longer  independent  quantities. 

Theorem  V.  Even  where  amj  system  of  relations  exists 
among  the  elements  xx ,  x> ,  ...  x„,  excluding  only  the  case  of  the 
equality  of  two  or  more  elements,  tee  can  still  construct  n\-valued 
functions  of  xn  .('_,,  .  .  .  X„.* 

Using  the  notation  of  the  preceding  Section,  we  start  from  the 
same  linear  function 

<r"      =   «o  +  «1^1  +    «2^2  +    •   •   •    +  a«Xn, 

and  form  the  product  of  the  differences  of  the  c-'s 

n{<pa—9r) 

n\(n\ 1) 

this  product  being  taken  over  the  -  '  1  '  9 —   possible   combinations 

of  the  cr's  in  pairs.     Expanding  we  have 

# (?<r —  ?r)  =  H  |>iUv,  —  av,)  +  a.Jx^  —  Xr.)  .  .  .  +  a,/-<V,.  — avj] 

In  no  one  of  these  factors  can  all  the  parentheses  vanish,  since 
otherwise  either  the  substitutions  a;  and  ~  must  be  identical,  or  else 
the  £c's  are  not  all  different.  The  product,  regarded  as  a  function  of 
the  a's,  therefore  cannot  vanish  identically  (§  2,  D).     Consequently, 

*Cf.  G.  Cantor:  Math.  Annalen  V,  133;  Acta  Math.  I.  372-3. 


■  V2  THEORY    OF    SUBSTITUTIONS. 

(§  2),  there  are  an  infinite  number  of  systems  of  values  of  the  a's 
for  which  all  the  n !  values  of  c  are  different  from  one  another. 

Corollary.  The  only  relations  among  the  ,r\s  which  can 
dt  U  rmine  the  equality  of  linear  expressions  of  the  form 

f  =  a0  +  «i#i  -+-  a2x2  +...+'■ 

independently  of  the  values  of  the  a?s,  are  the  relations  of  equality 
of  two  or  more  x's. 

§  33.  With  the  Theorems  III  and  IV  the  foundation  is  laid  for 
a  classification  of  the  integral  functions  of  n  variables.  Every  func- 
tion belongs  to  a  group  of  substitutions;  to  every  group  of  substi- 
tutions correspond  an  infinite  number  of  functions.  This  relation- 
ship is  not  the  only  connection  between  functions  which  are 
unchanged  by  the  same  substitutions;  we  shall  find  also  a  corres- 
ponding algebraic  relation,  namely,  that  every  function  which 
belongs  to  a  group  G  can  be  rationally  expressed  in  terms  of  every 
other  function  belonging  to  the  same  group. 

It  becomes  then  a  fundamental  problem  of  algebra  to  determine 
all  the  possible  groups  of  substitutions  of  n  elements.  The  general 
solution  of  this  problem,  however,  presents  difficulties  as  yet  insup- 
erable. The  existence  of  functions  which  possess  a  prescribed 
number  of  values  is  discussed  in  one  of  the  following  Chapters.  It 
will  appear  that  there  are  narrow  limits  to  the  number  of  possible 
groups.  For  example,  in  the  case  of  7  elements,  there  is  no  function 
which  possesses  3,  4,  5,  or  0  values;  and  we  shall  deduce  the  general 
proposition  that  a  function  of  n  elements  which  has  more  than  two 
values,  will  have  at  least  n  values,  if  n  >  4.  A  series  of  other  anal- 
ogous results  will  also  be  obtained. 

For  the  present  we  shall  concern  ourselves  only  with  the  con- 
struction and  the  properties  of  some  of  the  simplest,  and  for  our 
purpose,  most  important  groups.  * 

§  34.  First  of  all  we  have  the  group  of  order  n ! ,  composed  of 
all  the  substitutions.  This  group  belongs  to  the  symmetric  func- 
tions, and  is  called  the  symmetric  group. 

In  Chapter  I  we  have  seen  that  every  substitution  is  reducible 
to  a  series  of  transpositions.     Accordingly,  if  a  group  contains  all 

*  Cf.  Serrel :  Cours  d'algl  bre  Bup6rieure.  II,  ss  116-420.    Oauchy:  loc.  cit. 


CORRELATION  OF  FUNCTIONS  AND  GROUPS.  33 

the  transpositions,  it  contains  all  the  possible  substitutions  and  is 
identical  with  the  symmetric  group.  To  secure  this  result  it  is  how- 
ever sufficient  that  the  group  should  contain  all  those  transpositions 
which  affect  any  one  element,  for  example  a?, ,  that  is  the  transposi- 
tions 

(■<•,•'••>,     (•'•,•'•;>,    (XjXt),  .  .  .  (•*•,.*•„). 

For  every  other  transposition  can  be  expressed  as  a  combination 
of  these  n  1 ;  in  fact  every  (xaXfi)  is  equivalent  to  a  series  of  three 
of  the  system  above, 

(where  it  is  again  to  be  noted  that  the  order  of  the  factors  is  not 
indifferent).     We  have  then 

Theorem  VI.     A  group  of  n  elements  xt,  x2,  ...  x„  which 
contains  the  n  —  1  transpositions 

(Xa.X\),  [XgXzJi    .   ■   .    [XaXa — 1/)   (^a^'a  +  1  ))    •   •   •    (  '*a',i ) 

is  identical  with  the  symmetric  group. 

Corollary.     A  group  ivhich  contains  the  transpositions 

(jt'aJCp),   (xaXy),   .  .  .  (xaX#) 

contains  all  the  substitutions  of  the  symmetric  group  of  the  elements 

§  35.  We  know  further  a  group  composed  of  all  those  substitu- 
tions which  are  equivalent  to  an  even  number  of  transpositions.  For 
all  these  substitutions,  and  only  these,  leave  every  two-valued  func- 
tion unchanged,  and  they  therefore  form  a  group.  We  will  call 
this  group  the  alternating  group.  Its  order  r  is  as  yet  unknown, 
and  we  proceed  to  determine  it.     Let 

I)  s,  =  1,  s2 ,  s3,  ...  s,. 

be  all  the  substitutions  of  the  alternating  group,  and  let 

II)  «/,  s,',  s,',    ...   s/ 

be  all  the  substitutions  which  are  not  contained  in  I),  and  which  are 
therefore  composed  of  an  odd  number  of  transpositions.  We  select 
now  any  transposition  t,  for  example  <r  =  (.ryr.,),  and  form  the  two 
series 

I')  .S,T,     S.T,     Sgff,      .    .   .      8rff, 

II')  s/<r5  .s.,V,  s3'<r,    ...   s,'(7. 

3 


34  THEORY    OF    SUBSTITUTIONS. 

Then  every  substitution  of  I')  is  composed  of  an  odd  number  of 
transpositions,  and  every  substitution  of  II')  of  an  even  number. 
Consequently  every  substitiition  of  I')  is  contained  in  II),  and  every 
one  of  II')  is  contained  in  I) .  Moreover,  sa«x  j  8/j<r,  and  8a'<J  -j- Vff» 
for  otherwise  we  should  have 

sa  =  8a  (a  ■  a)  =  (saff)  a  =  (spff)  a  —  Sp(ff  ■  ff)  =  sp, 
sa'  =  sa'(v .  a)  =  (s0'«r)  a  —  (8P'ff)  <s  —  8p'(a  ■  <r)  =  sp', 
since  t  ■  a  =  (.<■,.()  (.'■,.«■..)  =  1.    . 

It  follows  from  this  that  rS.t  and  r  >.  t,  that  is  r  =  t.  Again, 
since  I)  and  II)  contain   all  the  substitutions,  r-\-t  =  n\.     Hence 

n\ 
2 

We  will  note  here  that  there  is  no  other  group  /'  of  order  -j  • 
For  a  function  y>,  belonging  to  such  a  group  would  be  unchanged  by 
".,'  substitutions,  and  would  be  changed  by  all  others.  It  would 
therefore  possess  other  values  beside  <fl .  Suppose  <p2  to  be  one  of 
these  values,  and  let  a  be  a  substitution  which  converts  y>,  into 
<p2  =  ?„.     If  now  <f{  is  unchanged  by  the  group 

Hi)  r=|i>v,  V,  ....^.i], 

then  <fx  must  be  converted  into  <f,  by  all  the  substitutions 
IV)  a,  s./ff,  s:/ff,  .  .  .  s'\„<<7; 

for  sA'  leaves  y,  unchanged  and  <j  converts  y,  mto  ?..,  consequently 
8\0  will  also  convert  y,  into  p3.  Again  all  the  substitutions  sa'rr  of 
the  series  IV)  are  different  from  one  another.  For,  if  sa'<r  =  s^V, 
it  would  follow  that  sa'  =  8p.  The  substitutions  s/ff  are  also 
•  lifferent  from  the  sA"s,  for  the  latter  have  a  different  effect  on  v'i 
from  the  former.  Consequently  III)  and  IV)  exhaust  all  the  possi- 
ble substitutions,  and  y,  is  therefore  a  two-valued  function,  for  there 
is  no  substitution  remaining  which  could  convert  y,  into  a  third 
value.     The  group  /'  is  therefore  the  alternating  group. 

Theorem  VII.  For  n  elements  there  is  on/if  one  group  of 
order  Y'  This  is  the  alleni<itin<i  (jroup.  II  l><:l<>>iqx  to  the  two- 
valued  functions. 

We  can  generalize  this  proposition.  The  proof,  being  exactly 
parallel  to  the  preceding,  may  be  omitted. 


CORRELATION  OF  FUNCTIONS  AND  GROUPS.  35 

Theorem  VIII.  Either  all,  or  exactly  half  of  the  substi- 
tutions of  every  group  belong  to  the  alternating  group. 

Corollary.  Those  substitutions  of  any  given  group  of  order 
r  which  belong  to  the  alternating  group,  form  a  group  within  the 
given  group,  the  order  of  which  is  either  r  or  f). 

The  simplest  substitutions  belonging  to  the  alternating  group 
contain  three  elements  in  a  single  cycle,  (xaXpXy).  They  are  equiv- 
alent to  two  transpositions,  (xaXpXy)  =  (xa^y)  (xpXy). 

A  substitution  containing  only  one  cycle  (x^,  xki  ...  xlit)  we 
shall  call  a  circular  substitution  of  order  m. 

Theorem  IX.  If  a  group  of  n  elements  contains  the  n  —  2 
circular  substitutions 

it  is  either  the  alternating  or  the  symmetric  group. 
For  since 
(XaXpXy)  —  (XjXoXp)  (XjXzXp)  (xvv,xy)  Uvr.,.ra)  (x^Xa)  {xxx.pc^), 

it  follows  that  the  given  group  contains  every  circular  substitution 
of  the  third  order.     And  again,  since 

'■''l''\-'":()   (XiXiX3)  =  (.»',.)•,)   (.l';''4),      (X}X3X2)   {XyV^.,)  --   (XiX3)   \X2X4), 

it  follows  that  all  substitutions  occur  in  the  given  group  which  are 
composed  of  two,  and  consequently  of  four,  six,  or  any  even  num- 
ber of  transpositions.     The  theorem  is  therefore  proved. 

We  add  the  following  theorem : 

Theorem  X.  If  a  group  contains  all  circular  substitutions 
of  order  m-\-2,  it  will  contain  also  all  those  of  order  n>,  and  con- 
sequently it  will  contain  either  the  alternating  or  the  symmetric 
(/roup,  according  as  m  is  odd  or  even. 

For  we  have 

[■I'^C.j    .  .  ..'',„•'',,•''/,)    [XiX'2    .  .  .    •  '',„•''„•''/,)    (■'',„•'',„  — l    •  •  •    ■'_••';.■'  \Xaf 
(  .1  [.)  j     ...     •',„_!   •'  ,„)• 

Finally,  we  can  now  give  the  criterion  for  determining  whether 
a  given  substitution,  expressed  in  cycles,  belongs  to  the  alternating 
group,  or  not.     The  proof  is  hardly  necessary. 


36  HIEOHV   or   SUBSTITUTIONS. 

Theorem  XT.     If  a  substitution  contains  ni   elements  in  /.• 

cycles,  it  does  or  does  not  belong  to  the  alternating  group  according 
as  in  —  k  is  even  or  odd. 

§  36.  Any  single  substitution  at  once  gives  rise  to  a  group,  if  we 
multiply  it  by  itself  /.  e.,  if  we  form  its  successive  powers.  The 
meaning  of  the  term  "power"  is  already  fully  defined  by  the  devel- 
opments of  §  27.     We  must  have 

s'"  =  s'"-1    s  =  s  ■  s'"-1  =  sm~2  -s2 

—  sa.  .  sfi   .  s>»-a-B  — 


The  process  of  calculation  of  the  powers  of  a  substitution  is  also 
clear  from  the  preceding  Sections.  If  wo  wish  to  form  the  second, 
third,  fourth,  .  .  .  «th  power  of  a  cycle,  or  of  any  substitution,  we 
write  after  each  element  the  second,  third,  fourth,  .  .  .  ath  following 
element  of  the  corresponding  cycle,  the  first  element  of  each 
cycle  being  regarded  as  following  the  last.  Thus,  from  the  cycle 
(■e,.c,.c,rvf->  .  .  .  )  we  obtain  for  the  second  power  (.*•,.<■;,.)'-  . . .  ),  for  the 
third  (.r,. !■,.<•;  .  .  .  ),  for  the  fourth  (.*',.<•-.(•,,  .  .  .  ),  etc.  It  is  obvious 
that  in  this  process  a  cycle  may  break  up  into  several.  This  will 
occur  when  and  only  when  the  number  of  elements  of  the  cycle  and 
the  exponent  of  the  power  have  a  common  divisor  d  >  1.  The 
number  of  resulting  cycles  is  then  equal  to  d. 

For  example, 

I  .I'j. »'_,.('. .»',.  *"-,-*",, )  -     (•'V':-'\)    I  .»\. '',.!',  ). 

( ,l'|.  I\.  <'.,.<',.  <',.'',,)  ('<V'|)    '•''_'■'',)    I  -''.l'''!,)} 

(..     ,.     ,.    ,.    r'vi      —     i   i'    *»    t*    \    i  v*  W  'y   I 
•'  I"  .'•'  ;c'  r'  :Art)     ' —    V"  l1'  v<  ::  I   *•'■:•'<.•    \l- 

(v.      .»       .<       .•      ..      >»     \''      /     .'      >•       »•      >•       *•      .'     \ 
,i    i  .«     n*     ..*    i.  (    p ,A  |;  f         \  •*    ]•*   j^*    -■*    !•'     {■'    ■)  J . 

If  the  mi  miter  of  elements  of  a  cycle  be  m,  then  the  m"',  (2m)tb, 
(3m)th,  .  .  .  poivers  of  the  cycle,  and  no  others,  will  be  equal  to  1. 

If  a  substitution  contains  several  cycles  with  ml,  m,,  m3, .  .  . 
elements  respectively,  the  lowest  power  of  the  substitution  which 
is  equal  to  1  is  that  of  which  the  exponent  /•  is  the  least  common 
multiple  of  to, ,  m2,  m,,  .  .  .       Thus 

|  (.rV  <•  )  (i <•,./■,)  l.r,,r,)\-  =  1. 

This  same  exponent  ;•  is  also  the  order  of  the  group  formed  by 
the  powers  of  the  given  substitution.     For  if  we  calculate 


CORRELATION  OF  FUNCTIONS  AND  GROUPS.  3  I 

S~,   S8,  .  .  .  ST-1,  8'  =   1, 

a  furthor  continuation  of  the  series  gives  merely  a  repetition  of  the 
same  terms  in  the  same  order: 

s'-+'=s,  s'-+2  =  s2,  sr+3  =  s3, . . .  a2'-1  =  Sr~\  S*  =  8r  =1,  ... 

Moreover  the  powers  of  s  from  s1  to  s'  are  different  from  one 
another,  for  if 

s\  —  s\+  m  =  sa  .gli     (yt  +  /i<.r), 

then  we  should  have  contrary  to  hypothesis 

S*  =  1      (/7.  <  r). 

The  extension  of  the  definition  of  a  power  to  include  the  case  of 
negative  exponents  is  now  easily  accomplished.     We  write 

s~k=  s'_A'  =  s'-v~*'=  .  .  . 
so  that  we  have 

sk  s~k  =  1. 

The  substitution  sA  therefore  cancels  the  effect  of  the  substitu- 
tion s  '',  and  vice  versa.  The  negative  powers  of  a  substitution  are 
formed  in  the  same  way  as  the  positive  powers,  only  that  in  forming 
( — l)st,  ( — 2)d,  ( — 3)d,  . .  .  powers,  we  pass  backward  in  each  cycle 
1,  2,  3,  .  .  .  elements,  the  last  element  being  regarded  as  next  pre- 
ceding the  first. 

It  may  be  noted  that  (st)"}  —  t"1  s~\  For  (sf)_1  (st)  =1 ,  and 
by  multiplying  the  members  of  this  equation  first  into  /  ~~ '  and  then 
into  s~\  we  obtain  the  result  stated. 

The  simplest  function  belonging  to  the  cycle  (.r,  .r,  .  .  .  xm)  is 

§  37.  Given  two  substitutions  sa  and  Sp ,  if  we  wish  to  deter- 
mine the  group  of  lowest  order  which  contains  .sa  and  Sp,  we  have 
not  only  to  form  all  the  powers  saA,  s^  and  to  multiply  these 
together,  but  we  must  form  all  the  combinations 

1,  sa\  V,  s/V1'  -spMsaA,  s/s^s/,  s^s/sp1; .  .  . 

Of  the  substitutions  thus  formed  we  retain  those  which  are  dif- 
ferent from  one  another,  and  proceed  with  the  construction  until  all 
substitutions  which  arise  from  a  product  of  m  factors  are  contained 
among  the  preceding  ones.     For  then  every  product  of  m  +  1  fac- 


:^S  THEORY    OF    SUBSTITUTIONS. 

tors  is  obviously  reducible  to  ono  of  m  factors,  and  is  consequently 
also  contained  among  those  already  found.  The  group  is  then 
complete. 

///  case  8p8a  =aaSpMj  the  corresponding  group  is  exhausted  by  all 
the  substitutions  of  the  form  saKSp\     For  we  have  in  this  case 

Sfi   8a  =  SpSa  Spf1  =  SfiSa-  Sf  —  Sa  Sf, 


SpmSa=8aS^i 
Spm'sa=Sa2Spm'l2Sa  =  Sa3Sfr*\ 


S/3     Sa    —Sa   Sp    * 

Consequently  any  product  of  three  factors  is  reducible  to  a  product 
of  two.     Thus 

SaPSfi'TSaT=Sa(P  +  T)S^T% 
SpPSa'Sp^SSSfP+ti^, 

and  the  theorem  is  proved. 
For  example,  let 

■S'l    ~~  ~    (.l'r >'_,.('..' ',.'',  ),  .S'_,    =    (  • ' "   ■  '•''-'' i  )  j 

then 

,S'  ,.S'j   - —   {  ,t  j-^_i-'  |**;j/   "i   **J  • 

The  group  of  lowest  order  which  contains  s,  and  s2  contains 
therefore  at  the  most  5  •  4  =  20  substitutions.  To  determine  whether 
the  number  is  less  than  this,  we  examine  whether  it  is  possible  thai 

8]aS2P=  8{"82S. 

If  this  were  the  case,  it  would  follow  that 

I  Jut  in  the  scries  of  powers  of  82  there  is  only  one  which  is  also  a  pow- 
erof  sn  and  this  is  the  zero  power.     Consequently  we  must,  have 
a      pand/?=  8.     The  group  therefore  actually  contains  20  substi 
tut  ions.     These  are  the  following,  where  for  the  sake  of  simplicity 
we  write  only  the  indices: 


CORRELATION  OF  FUNCTIONS  AND  GROUPS.  39 

Sl°  =  1,  s2  =  (2351 ),  .sv  =  (25)  (34),  a33     (2  1 53 ), 

V  =  ( 1 2345),  s,s2  =  (1325),  rf  =  (15)  (24),  a,*.3  =  (1435), 

•V  =  (1 3524),  Sl2sa  =  (1534),  a,V  -  (14)  (23),  a,  V  =  (1254), 

a,8  =  (14253),  *,'*,  =  (1243),  b,V  =  (13)  (45),  a^8  =  (1523), 

.s,'^  (15432),  a1*a2  =  (1452),  Sj V  =  (12)  (35),  a^8  =  (1342). 

Analogous  results  may  be  obtained,  for  example,  for  the  case 

— ■  f  y  /y*  /y*  /y*  /v  fY*  /v*    i  c    —   (  y*    v  /y*  "y*  /y*  ,y*   i 

I  —  V    '1*     '     ■  '<     \     5    6    tJi  —  V     '      i    3*^ T"' 5*^-  ti 7* 

///  case  everj/  s^Sa  (m=1,  2,  3,  .  . .)  can  be  reduced  to  the  form 
8aKSp\  the  group  of  lowest  order  which  contains  sa  and  Sp  is  exhausted 
by  the  substitutions  of  the  form  saK8p\ 

For  by  processes  similar  to  those  above  we  can  bring  every  sub- 
stitution sp?sav  to  the  form  saK,sj3A .  The  proof  is  then  reduced  to  the 
preceding. 

Furthermore  if  sp'  is  the  lowest  power  in  the  series  Sp,  sp,  .  .  . 
which  occurs  among  the  power  of  sa,  then  the  group  contains  q  times 
as  many  substitutions  as  the  order  A;  of  sa.  For  in  the  first  place,  if 
the  exponent  /  in  saKSpK  is  greater  than  q  —  1,  we  can  replace  Sp*  by 
a Sa^S/s",  where  v<.q  —  1.  There  are  therefore  at  the  most  q  ■  k  differ- 
ent substitutions  saKSp\     Again  if 

then  we  must  have,  if  we  suppose  A  >  v, 

8(3*-"  =  a.**-"     (A— v<q  —  1), 

and  consequently  /.  =  v,  p.  =  /. .  There  are  therefore  actually  q  ■  k 
different  substitutions.  It  is  readily  seen  that  q  is  a  divisor  of  the 
order  r  of  Sp. 

If  three  substitutions  sa,  sp,  sy,  are  such  that  for  every  ,". 

sf  sa  =  sj  spe,  a/  sa  =  sj  Sp*  a/ ,     a/  Sp  —  saL  SpK  sy\ 

and  if  k  be  the  order  of  sa,  and  sp1  the  lowest  power  of  sp  which  is 
equal  to  a  power  of  sa,  sa",  finally  if  sy'  is  the  loivest  power  of  sy 
which  is  equal  to  sanspv,  then  the  group  of  lowest  order  which  con- 
tains sa,  Sp,  sy  is  of  order  kqt,  and  its  substitutions  are  of  the  form 

sJsp'Syi    (<J  =  0,  1,  .  .  .  k—1)  e  =  0,  1,  .  .  .  q  —  1;  :  =  0,  1,  .  .  .  t—  1). 

The  proof  is  simple  and  so  clearly  analogous  to  the  preceding 
that  we  may  omit  it. 


10  THEORY    OF    SUBSTITUTIONS. 

$  38.     With  this  set  of  propositions  belongs  also  the  following: 
If 

G=[l,  8a,  8a,  .  .  .  8,  | 
H=[l,t2,  ta,   ...//| 

be  two  groups  of  substitut ions  brlirmi  which  the  relation 

S„.tp  =    tySl 

holds  for  all  values  of  a  and  /?,  and  if  furthermore  G  ami  II  have 
no  substitution  in  common  except  identity,  thru  all  the  combinations 

*afp,  or  tpsa,  (a=  1,  2,  ...  r;  fi=  1,  2,  .  .  .  /■')  form  a  group  of  order 
rr'  which  contains  G  and  H  as  subgroups. 

For  since 

sjp  •  syt&  =  sa(fyjsv)  t8  =  sa(.st  •  tc,  )t&  =  S,J„, 

the  substitutions  satp  form  a  group  of,  at  the  most,  rr'  substitutions. 
And  we  will  show  also  that  all  of  these  are  different  from  one  an- 
other.    For  if,  for  example, 

"a  tp  =  Sy  t$ 

then  if  we  multiply  both  sides  of  this  equation  by  sy—1  at  the  left 
and  tp  ~ '  at  the  right  we  obtain 

Sy  Sa  =    t&tp 

But  Sy  ''  sa  is  a  substitution  of  G  and  t&  tp  ~ '  a  substitution  of  H,  and 
consequently  they  can  only  be  equal  if  both  are  equal  to  1.     Hence 


Sy           Sa  - —   1 , 

t&  tp      —  1, 

Sa    Sy, 

h  =  tp- 

The  substitutions  of  the  new  group  are  then  all  different,  and  the 
order  of  the  group  is  therefore  rr'.     We  denote  the  group  by 

K=  \G,  H\. 

We  add  without  proof,  the  following  generalization  of  the  last 
theorem. 

Under  the  same  assumption  8atp=  tys,,  if  the  two  groups  G  and 

rr' 
H  hare  /.  substitutions  in  common  there  18  "  group  of  order  —j-ivhich 

contains  G  and  H  as  subgroups.* 

§  S9.     In  later  developments  a  group  will  frequently  be  required 

*F.  Gludice.    Palermo  Bend.  I.  pp.  222  223. 


CORRELATION  OF  FUNCTIONS  AND  ORODP8.  41 

the  order  of  which  is  a  power  of  a  prime  number  p.  The  exist- 
ence of  such  a  group  will  be  demonstrated  by  the  proof  of  the  fol- 
lowing proposition,  from  which  the  nature  of  the  group  will  also  be 
apparent. 

Theorem  XIT.  If  p'  be  tin-  highest  power  of  the  prime 
number  />  which  is  a  divisor  of  the  product  n\  =  1  •  2  •  3  . .,  />,  then 
there  is  a  group  of  degree  n  and  of  order  p. 

In  the  first  place  suppose  n  <  p~,  so  that  n  =  ap  -\-  h  (a,  b  <  p). 
Then,  of  the  numbers  1,  2,  3,  .  .  .  n,  only  p,  2/»,  3p,  .  .  .  <i}>  are 
divisible  by  p,  so  that/=  a.  We  select  now  from  the  n  elements 
a  systems  of  p  betters  each,  aud  form  from  each  system  a  cycle,  as 
follows: 

Then  the  group  which  arises  from  these  is  the  group  required : 

JS-\  =  |^Sj ,  S,  ,   ...  .S._,  ,S2  ,  .  .  .  S„ ,  S„  ,  .  .  .  J  =  }  Sj ,  So ■  .  .  .  «S'„  j . 

For  every  sA  with  its  various  powers  forms  a  subgroup  of  order  p, 
and  since  no  two  of  these  a  subgroups  have  any  element  in  common, 
it  follows  from  Theorem  II  that 

Sk<,si°  =  sSskp, 

Accordingly  every  possible  combination  of  substitutions  s,a,  s2^,  .  .  . 
belonging  to  K  can  be  brought  to  the  form 

s^s/s.y ....  sav    (a,  p,  r, . . .  v  =  0, 1,  2, . . .  p— 1). 

The  group  K  therefore  contains  at  the  most  p"  substitutions.  And 
it  actually  contains  this  number,  for  all  these  p"  operations  are  dif- 
ferent from  one  another.     For  if 

sfsfsj  .  .  .  sav  =  s^'s./'s-y  .  .  .  s/', 
it  would  follow  that 

o  —  a'o  a  —  o  a  —  a'  —  ..  8'..  y>  a  v> ,.  —  Va        — /oc.  Q  —  y<,  — (3  —  a  fi'  ~  Po  y'  —  y 

and  therefore,  since  Sj ,  has  no  element  in  common  with  sa ,  S3 ,  . . . , 
we  must  have  a  =  «',  etc. 

Again,  if  n=p2,   we    shall   have/  =  p  +  l,  since  in  the  series 

*In  the  designation  of  a  group  the  brace,  |    |  ,  as  .distinguished  from  the  bracket,  T  J< 

indicates  that  the  group  referred  to  is  the  smallest  group  which  contains  the  included 
substitutions.  The  bracket  contains  nil  the  substitutions  of  the  group  considered,  while 
the  brace  contains  only  the  generating  substitutions.  The  latter  can  generally  be  se- 
lected in  many  ways.    df.  the  notation  at  the  close  of  the  last  Section. 

3a 


42  THEORY    OF    SUBSTITUTIONS. 

1,  2,  3,  .  .  .  p:,  the  numbers  p,  2p,  Sp,  .  .  .  (p  —  l)p,  p*  are  divisible 
by  p.     We  form  now  again  the  substitutions 

,S', ,  s2j  .s,(, . .  .  sI>} 

as  before,  and  in  addition  to  these  the  substitution  .s,,  (.  ,  which  affects 
all  the  jr  elements 

—  I  'V    'v     'V*  *■     t*     »*  ^y    *>*  'V*  o^     \ 

i>  +  i  —  V    'i    *i    'i  •  •  •  *Ki\,K  >v  *s  •  •  •      '.'    *8  '  *  *     H  '  '  '     ' i<  )• 

Then  the  required  group  is 

K.,  =  j  «Sj ,  s2 ,  . . .  Sjj ,  sp  _,_,(. 
For  in  the  first  place  we  can  readily  show  that 

sl    Sj>  +  1     —  si>  +  ls2i  ,S'i'sV  +  l         ~Si'  +  l    Sa+u  Sp    Sp  +  i   -—  Sp+  ,  .S,  , 

SA  o  O  O    «  t*     A  C»  Q  O  A  V     A  q  O  O    A 

1    «*p  +  1      —  ">  +  1*2   >  *o  *^  +  1      —  Oj)  +  1     *a  +  1    5  *y<    ap  + 1    —  d/>  +  1  dl     » 

SA  r>               -     o              -  o    A                              V    A  t!                       O               *   ©               A                   «*!    "  ij                    O  -    o   A 

1    SJ»  +  1      ' J>  + 1    *3    »  *a      />  + 1       ./'  + 1       a  +  2     5  *{'     BJ>  +  1     °i>  +  1     '  -     > 

8j    S,,  +  j*1  =  S^,  +  j**  S^  +  i    ,       Sa    Sp  +  i     =  *p  +  ]    sa  +  n    >       ^>    s^)  +  l    "~"S^  +  1     ,Sy  ' 

Accordingly  every  combination  of  the  substitutions  st ,  s2 , . . .  8P +J 
can  be  brought,  as  in  §  37,  to  the  form 

s.^AV  •  •  •  V  Sp  +  f     (a,  /9,  r,  . . .  i,  x  =  0, 1,  2,  . . .  p—  1). 

But  we  must  also  show  in  the  present  case  that  we  need  only  take 
the  powers  of  sp  +  ,  as  far  as  the  ( p  —  l)Ul .     We  find  that 

•S',.  ;-l     — ~  '•''']•'''■_.•'''':;  •   •   •  "•**',,)     {.^'k^ka  '   •   •  Wb„)  •  •   •  Kp^ti^tn  •   •   •  **''«/ 

=  S182  .  .  .  Sp, 

Sal'  —  r.  a  t .  a  o  a 

p  +1        —  °l    °i!      •   •   •  °p   • 

Consequently,  if  k~>p,  we  can  replace  the  highest  power  of  *,,  +  i" 
which  occurs  in  8p+1k  by  powers  of  s,,  s2,  .  .  .  sy,,  and  these  can  then 
be  written  in  the  order  above. 

The  question  then  remains  whether  the  p1' + l  =pf  substitutions 
thus  obtained  are  all  distinct.     If  two  of  them  wero  equal 

..  a..  /5  o  io  < —  a  a'v  /3'  o  i'o  k' 

.">!   »2     •  •  •  °jp  °p  +  l     —  "l     "a       •  •  •  °P     -J'+l      J 

we  should  have 

t.  K  —  «'  —  a  a'  —  av  fi'  —B  o   i'  —  i 

*v,  _j_]  —  *j  »2  •   •  •  *i» 

But  the  substitution  on  the  right  does  not  affect  the  first  subscripts 
i,  fc,  .  .  . ,  while  that  on  the  left  does,  unless  /.  =  /.'.  The  proof  then 
proceeds  as  before. 

If  n>p-  but  <  i?,  that  is,  if  u  =  a/r  -\- bp  -{-  c   (a,b,c<p), 
we  select  from  the  n  elements  j\  any  a  systems  of  p2  elements  each. 


CORRELATION  OF  FUNCTIONS  AND  GROUPS.  43 

and  any  other  b  systems  of  p  elements  each.  With  the  former  we 
construct  a  groups  K,,  and  with  the  latter  b  groups  K, .  The  com- 
bination of  these  a  -f-  b  groups  gives  the  required  group  K3.  For 
the  product  of  the  numbers 

(a-l)if  +  l,  (a-l)p2  +  2,  .  . .  (a-l)j>3  +p,  . . . 
(a— l)pt+pi,     (a<p) 

is  divisible  by  only  the  same  power  of  p  as  the  product  of 

1,  2,  . . .  p,  . . .  p\ 

Again,  if  n  =p9,  then  the  exponent/  of  py  is  increased  by  1  on 
account  of  the  last  term  of  the  series 

(p-l)p*  +  l,(p-l)p2  +  2, . . .  (j>_l)ps+p,  . . . 

(p  —  l)2r+p-=p\ 

so  that  in  this  case  the  multiplication  of  the  p  partial  groups  K,  is 
not  sufficient.  In  this  case,  exactly  as  for  n  =  p\  we  add  another 
substitution  which  contains  all  the  p  ■  p'  elements  in  a  single  cycle, 
and  the  pth  power  of  which  breaks  up  into  the  p  substitutions  as  inr 
the  case  of  sp  +  l  above.  Then,  as  in  that  case,  we  can  show  that  the 
new  group  satisfies  all  the  requirements.  At  the  same  time  it  is 
clear  that  the  method  here  followed  is  perfectly  general,  and  accord- 
ingly the  theorem  at  the  beginning  of  the  Section  is  proved. 

§  40.     Since  all  the  groups  Kx ,  K2,  K3 ,  .  .  .  enter  into  the  forma- 
tion of  the  group  iv,  we  have  the  following 

Corollary.     //  pJ  is  the  highest  power  of  p  which  is  a  divi- 
sor of  n\ ,  then  ire  can  construct  a  series  of  groups  of  n  elements 

1,  .K\ ,  K2 ,  ...  K\ ,  K\  +  j ,  ...  Ky 

which  are  of  order  respectively 

l,p,p\...p\pK  +  \  ...p\      "» 

Every  group  /\'A  is  contained  as  a  subgroup  in  the  next  following 

K\  + 1  • 


CHAPTEE  III. 


THE    DIFFERENT    VALUES    OF    A    MULTIPLE-VALUED    FUNC- 
TION AND  THEIR  ALGEBRAIC  RELATION 
TO  ONE  ANOTHER. 

§  41.     We  have  shown  in  the  preceding  Chapter,  that  to  every 

function  of  n   elements  .r,,  .r.,,  x3 v„  there  belongs   a  group   of 

substitutions,  and  that  conversely  to  every  group  of  substitutions 
there  correspond  an  infinite  number  of  functions  of  the  elements. 
The  examination  of  the  relations  between  different  functions  which 
belong  to  the  same  group  we  reserve  for  a  later  Chapter.  The 
problem  which  we  have  first  to  consider  is  the  determination  of  the 
connection  between  the  several  values  of  a  multiple-valued  function 
and  the  algebraic  relations  of  these  values  to  one  another. 

If  <p  (xu  £C2, . . .  £C»)  is  not  a  symmetric  function,  or,  in  other 
words,  if  the  substitutions  s,  =  1,  s.,,  s3,  .  .  .  sr  of  the  group  G  be- 
longing to  c  do  not  exhaust  all  the  possible  substitutions  (i.  e.  r  <  v  ! ). 
then  <f ,  on  being  operated  upon  by  any  one  of  the  remaining  substi- 
tutions ff2j  will  take  a  new  value  <p2  =  <p9v 

We  proceed  to  construct  a  table,  the  first  line  of  which  consists 
of  the  various  substitutions  of  the  group  G: 

s,  =  l,  82,8a,  .  .  .«,.;     G;     c,. 

The  second  line  is  obtained  from  the  first  by  right  hand  multi- 
plication of  all  the  substitutions  8\  by  n,.     This  gives  us 

<r2,  8202j   s:'7.:i  ■  •  •  8ra2l       Q  '  ff2j       ^2« 

We  show  then,  as  in  Chapter  II,  §  85,  1)  that  all  substitutions  of 
this  line  convert  cr,  into  c,;  for  since  crya  =  cr,,  it  follows  that 
c->o<r.,=  cv,  =  <?■,',  2)  that  no  other  substitutions  except  those  of  this 
line  convert  v,  into  <s,;  for  if  r  is  h  substitution  which  has  this 
effect,  then  we  shall  have 


MULTIPLE-VALUED    FUNCTIONS — ALGEBBA*      RELATIONS.  4l> 

so  that  rrr.,  leaves  the  function  c,  unchanged;  consequently 
r<r.,  =,sA  and  r  =  (r<ra  ' ) a,  =  S\<r2 ,  and  therefore  r  is  contained  in 
the  second  line;  3)  that  all  substitutions  of  this  line  are  distinct;  for 
if  saf7.,  =  s^.,,  it  follows  that  sa  =  sj8;  4)  that  the  substitutions  of 
this  line  are  all  different  from  those  of  the  first;  for  the  latter  all 
leave  v,  unchanged,  while  the  former  all  convert  c,  into  cr_, . 

If  the  2r  substitutions  S\  and  S\<r2  do  not  yet  exhaust  all  the  pos- 
sible ii !  substitutions,  then  any  remaining  substitution  <r,  will  con- 
vert ft  into  a  new  function  ?VS  =  <Pz\  for  all  the  substitutions  which 
produce  tr,  and  c,  are  already  contained  in  the  first  two  lines.  By 
the  aid  of  <r3  we  form  the  third  line  of  our  table 

ff3j   S2«J"8J   '%i7.;i    •  •   •   Srff3J        G-  ffi\  <r'.;  • 

The  substitutions  of  this  line  have  again  the  four  properties  just 
discussed.  They  are  all  the  substitutions  and  the  only  ones  that 
convert  c,  into  <p3 ,  and  they  are  all  different  from  one  another  and 
from  those  of  the  preceding  lines. 

If  these  3r  substitutions  do  not  exhaust  all  the  possible  n\,  we 
proceed  in  the  same  way,  until  finally  all  the  n !  substitutions  are 
arranged  in  lines  containing  r  each. 

We  shall  frequently  have  occasion  to  construct  tables  of  this 
kind.  All  these  tables  will  possess  the  properties:  1)  that  all  the 
substitutions  in  any  line  will  have  a  special  character;  2)  that  only 
the  substitutions  of  this  line  will  have  this  character;  3)  that  all  the 
substitutions  of  any  line  are  different  from  one  another;  and  fre- 
quently, but  not  always,  the  fourth  property  will  also  appear :  \ ) 
that  all  the  substitutions  of  any  line  are  different  from  those  of  any 
other  line.  * 

Summarizing  the  preceding  results  we  have  the  following 

Theorem  I.  If  the  multiple-valued  function  c  (.r,.  .*•_,,  ...  x  I 
has  in  all  p  values<pu  c,,  c':;,  . . .  <pp  and  if  c  is  converted  successively 
into  these  rallies  by  certain  substitutions,  for  example  1 ,  t  . .  <r3}.  .  .  rrp, 
furthermore,  if  G,  the  group  of  <p,  is  of  order  r  and  contains  the 
substitutions  *,  =  1,  s2,  s3,  .  .  .«,,  we  can  arrange  all  the  possible  n\ 
substitutions  as  in  the  following  table: 

•  Such  tables  were  given  by  Cauchy:    Exerclces  d'analyseet  de physique  matbemat- 
ique.  III.,  p.  184. 


46  THEORY    OF    SUBSTITUTIONS. 

c., ;         ff2,     ,s\  f7._, ,    S3<J"2,  .  .  .  S, t_.  ;  (?!  •  ffj 

tr.,;        er8,    S2<r8,   .S':,fl-;i,  .  .  .  .s,.ff;J;         (?!  •  ffa 


crp;       «7P,     82<rp,  s8(Tp,  .  .  .  Sr<rp;       <?,  •  <tp 

in  which  every  line  contains  all  and  only  those  substitutions  which 
convert  <-  into  the  value  <pa  prefixed  to  the  line. 

The  several  values  cr,,  c,,  . . .  <pp  of  the  function  <f  are  called  con- 
jugate values. 

§  42.  From  the  circumstance  that  all  the  substitutions  of  this 
table  are  different  from  one  another,  and  that  the  />  lines  of  the 
table  exhaust  all  the  possible  substitutions  we  deduce  the  following 
theorems : 

Theorem  II.  The  order  r  of  agroup  (I  of  n  elements  is  a 
divisor  of  n\ 

Theorem  TTI.     The  number  p  of  the  values  of  an  integral 

function  of  n  elements  is  a  divisor  of  n\ 

Theorem  IV.  The  product  of  the  number  p  of  the  values 
of  an  integral  function  by  the  order  r  of  the  corresponding  group 
is  equal  to  n ! 

The  third  theorem  imposes  a  considerable  limitation  on  the  pos- 
sible number  of  values  of  a  multiple  valued  function.  Thus,  for 
example,  there  can  be  no  seven-  or  nine-valued  functions  of  five 
elements.  But  the  limits  thus  obtained  are  still  far  too  great,  as  the 
investigations  of  Chapter  V  will  show. 

§  43.  Precisely  the  same  method  as  that  of  §  41  can  be  applied 
to  the  more  general  case  where  all  the  substitutions  of  the  group  G 
belonging  to  tp  are  contained  in  a  group  H  belonging  to  another 
function  4'i  so  that  G  is  a  part  or  subgroup  of  11,  just  as  in  the 
special  case  above  G  was  a  subgroup  of  the  entire  or  symmetric 
group.  We  see  at  once  that  all  the  substitutions  of  H  can  be 
arranged  in  a  series  of  lines,  each  line  containing  r  substitutions  of 
the  form  *A^,  (;  L,  2,  . .  .  r).  And  we  pass  directly  from  the  pre- 
ceding to  the  present  case  by  reading  everywhere  for  "all  possible 
substitutions"  simply  "all  the  r,  substitutions  of  H".  We  have 
then 


MULTIPLE -VALUED  FUNCTIONS— ALGEBRAIC  RELATIONS.       47 

Theorem  V.  If  all  the  r  substitutions  of  the  gran/,  a  are 
contained  among  those  of  a  group  H  of  order  r, ,  then  r  is  a  divisor 

Theorem  VI.  Given  hvo  functions  <p  (xx,  x.2,  ...xjand 
(p  (.»',,  .(•.,,  .  .  .  .r„),  if  </'  retains  the  same  values  for  all  substitutions 
which  leave  c-  unchanged,  the  total  number  of  values  p  of  y  is  a  mul- 
t/pie of  the  total  number  of  values  px  of  <f>. 

For  we  have 

_n\  ii\  >>        r, 

r  '  r{ '  px         r  ' 

Corollary.  //'  a  function  <p(di\,  .  .  .  .(•„)  belongs  to  a  subgroup 
G  of  the  group  H,  and  if  r  is  the  order  of  G  and  r,  that  of  H, 
then  ip  on  being  operated  upon  by  the  substitutions  of  H  takes  exactly 

—  values. 
r 

§  44.     By  a  still  further  extension  of  the  subject  we  may  include 
the  case  where  two  groups   G    and  H    contain  any   substitutions 
in  common.     This  case  can  be  at  once  reduced  to  that  of  the  prece- 
ding Section.     For  this  purpose  we  employ  the  following  proposi 
tion : 

Theorem  VII.  The  substitutions  common  to  hvo  groups 
form  a  new  group,  the  order  of  which  is  accordingly  a  divisor  of  the 
orders  of  both  the  given  groups. 

For  if  t  and  r  belong  to  both  Gx  and  G,  then  a  ■  z  also  belongs  to 
both  Gx  and  G,  and  occurs  among  the  common  substitutions.  The 
same  result  can  also  be  obtained  as  follows.  If  y>,  and  <s.,  be  func- 
tions belonging  to  Gx  and  G,  respectively,  then  the  function 

where  a  and  ,i  are  arbitrary  constants,  remains  unchanged  for  those 
substitutions  which  leave  both  ft  and  tp%  unchanged,  that  is,  which 
are  common  to  Gx  and  G,.  These,  being  all  the  substitutions  which 
belong  to  9'',  form  a  group. 

Corollary  I.  Two  groups  ivhose  orders  are  prime  to  each 
other  can  have  no  substitutions  in  common  except  the  identical  sub- 
stitution. 


}S  THEORY    OP    SUBSTITUTIONS. 

Corollary   II.     The  order  of  every  group  II  which  consists  of 

nil  or  a  pari  of  the  substitutions  common  to  lh<-  two  groups  U]  and 
G   is  a  divisor  of  both  /',  and  r. 

£  IT).      We  proceed  next  to  determine  and  tabulate  the  groups 
which  belong  to  the  various  values  <p{  of  cr»  («  —  1?  %  3,  .  .  .  p). 
The  group  G=  Gt  of  fl  contained  the  substitutions 

Sj  —  J. ,  So,  S3,  ...  s, .. 

The  value  <p2  of  v  was  obtained  from  y,  by  the  substitution  a2\  con- 
sequently t_,  '  converts  <p2  back  into  cr, .  If  then  we  apply  to  <p2  suc- 
cessively the  substitutions  af1,  sa,  <r2,  the  first  of  these  will  convert 
c,  into  Cj ,  the  second  will  leave  cr,  unchanged,  and  the  third  will  con- 
vert cr,  back  into  c,.  It  appears  therefore  that  cr..  is  unchanged  by 
every  substitution  of  the  form  <r2~1saff2,  (a=  1,  2,  .  .  .  r).  For  the 
second  line  of  our  table  we  take  therefore 

(J.,"1  S  jffj  =  1 ,        ff2_  '  S2  ff2  j        ff2_1  sr,  ff2 1     •  •  •     ff2  ~  '  Sr  "'-  ■ 

We  can  then  show  that  this  line  contains  all  the  substitutions 
belonging  to  the  group  of  <p2.  For  if  r  be  any  substitution  which 
leaves  cr,  unchanged,  then  za.r1  will  convert  <f,  into  cr,,  that  is 

Consequently  the  substitution  a2ra2~  '  belongs  to  the  group  of 
c,,  and  we  may  write  it  equal  to  sa.  But  from  the  equation 
ff2T<r2~l  =  sa  follows  -z  —  a.,  *(<7.,7(7.r,)<7.,=z  <j.r]  ,sa>>.,,  as  was  asserted. 
Again  it  is  easily  seen  that  all  the  substitutions  of  the  second 
line  are  different  from  each  other.     For  if 

a,    '  sa  ff2  —  ff.r  '  Sfi  <s2 , 
it  follows  that 

8a  =$B- 

We  may  note  however  that  the  substitutions  of  the  second  line 
are  not  necessarily  different  from  those  of  the  first.  In  fact  the 
identical  substitution  is  of  course  always  common  to  both  and  other 
substitutions  may  also  occur  in  common.     (Cf.  §  50). 

From  the  three  properties  of  the  second  lino  obtained  above,  it 
follows  that  the  /■  substitutions  of  this  line  form  the  group  of  <p2. 
We  will  denote  this  group  by  (J..  That  these  substitutions  from  a 
group  can  also  be  shown  formally;  for 


MULTIPLE-VALUED    FUNCTIONS ALGEBRAIC    RELATIONS.  49 

(a~  l8affa)  (ff2      lSfi<Ta)   =  <7.r^a(<T/r.,-  ')Spff2  =    &2      '<*„*,,)  <7,(, 

so  that,  if  stt,  S/5,  .  .  .  form  a  group,  as  was  assumed,  the  same  is  true 
of  the  new  substitutions. 

Similar  results  hold  for  all  the  other  values,  c,,  <sn  .  .  .  <sp  of  <s. 
and  we  have  therefore 

Theorem  VIII.     If  the  values  v,,  <p2,  . . .  <pp  of  a  p-valued 

function  co  proceed  from  c  by  the  application  of  the  substitutions 
,-j  —  l.rr.,,  /T:j,  . . .  <rp,  then  the  groups  <7,,  G2,  .  .  .  Gp  of  <sx,  co2,  .  .  .  cp 
respectively  are 

G1  =  [s1  =  l,s2,s3,  .  .  .  s,.], 

rT\  =  [a.r '  gjfl-2  =  1 ,  t2-  '  •s'j'r-'  i  ^2"" '  s:j'72  5  •  •  •  ff2~ ]  sr  tr2]  =  ^j-1  ^'l  ff2  • 

r  r'p  =  [  V  '  Sl  ffP  =  1>    ffP_  '  $»*»»  »    V  '  Vp  »  •  •  •  °f '  *^p]  =  ">~~  '  &1  V 

§  40.  The  functions  c5x,  e,,  .  .  .  crp  are  of  precisely  the  same 
form  and  only  differ  in  the  order  of  arrangement  of  the  X\S  which 
enter  into  them.  Such  functions  we  have  called  (§3)  similar  or  of 
the  same  type.  Accordingly  the  corresponding  groups  G,,  02,  ... 
must  also  be  similar  or  of  the  same  type,  that  is  they  produce  the 
same  system  of  rearrangement  of  the  elements  .x\  and  only  differ 
in  the  order  in  which  the  elements  are  numbered.  This  is  clear  a 
priori,  but  we  can  also  prove  it  from  the  manner  of  derivation  of 
<*V~  "v?  from  sa ,  and  in  fact  we  can  show  that  not  only  the  groups 
Cr, ,  G2 ,  .  .  . ,  but  also  the  individual  substitutions  sa  and  trr~  1saT;  are 
similar;  that  is,  these  two  substitutions  have  the  same  number  of 
cycles,  each  containing  the  same  number  of  elements.  The  process 
of  deriving  the  substitutions  <rf~ ^^  from  the  s<,'b  is  called  trans- 
formation. The  substitution  ^,- ^a"",  is  called  the  conjugate  of  sa 
with  respect  to  v,-,  and  similarly  the  group  Gt  is  the  conjugate  of 
Gx  with  respect  to  <r;.  We  shall  denote  this  latter  relation  frequently, 
as  above,  by  the  equation 

Qt=fft-lGi*t. 

To  prove  the  similarity  of  sa  and  o"_1saT,,  let  us  suppose   that 
(a?!,  x2,  . .  .  xa)  is  any  one  of  the  cycles  of  sa  and  that  <r{  replaces 
05,  ,'x2,'. . .  xabv  jc,-.,  sc&j  .  .  .  -*\a,  so  that,  in   the  notation  A  of  §  22, 
<r  mav  be  written 
4 


")!)  THEORY    OF    SUBSTITUTIONS. 


/  .1']    .<\    .  .  .    .i'a  \ 


Then  the  factors  of  the  substitution  ff<_Is0<r,  will  replace  a-,,  success- 
ively by  .»•,,. r  .  ae  :  similarly  .»\,  will  be  replaced  by  '  .  as  l>y  '  . 
and  finally  .r,a  by  •<',, .  Accordingly  t,  '.sa<7,-  contains  the  cycle 
(a  '  .  .  .  .<\a),  and  this  is  obtained  from  the  corresponding  cycle 
(a?,  •'•_  .  .  .  'a)  of  «a  by  regarding  this  cycle,  so  to  speak,  as  a  function 
of  the  elements  .rA  and  applying  to  it  the  substitution  a{.  In  the 
same  way  every  cycle  of  <?i~lsaiTi  proceeds  from  the  corresponding 
cycle  of  sa.  The  two  substitutions  have  therefore  the  same  number 
of  cycles,  each  containing  the  same  number  of  elements,  as  was  to 
be  proved. 

Example:     The  function  of  four  elements 

has,  as  we  have  seen,  three  values,  and  its  group  Gx  is  of  order 
-^  =  8.  The  substitutions  t2  =  (.'•_,.<•;)  and  t8  =  (as2as4),  which  are  not 
contained  in  6rt,  convert  f,  into 

C  .,   ./  i  .A  ■>       J       .{  .,  .1   j  . 

C';;  —  Xj  •'',  ~T~  •''.'  •'';  < 

respectively.  By  transposition  with  respect  to  ffa  aU(l  ff8i  we  obtain 
from 

(.!-,.  '•,■''■'•;  )J, 

the  two  groups  belonging  respectively  to  c,  and  c- . . 

1 1,  (.«'|. <',:),  i  '■'',).  (•'',•''  •  (■'■■•'', ),  (.r,.x2)  (. '■;.'■, ).  ( .'■,.'', )  ( .'■  '■  ),  [x1x2XgXi), 
(.'■      -    i   1 1 , 

[_1,  (&1&4))    (•tV^i)?    V^l**"-!/ (^V*^/*    (aV':;l  '•'V'lh   (•'',•''') '•''  -''i  '•    (.'V'::-''r'j'- 

£  17.     Corollarj    T.     //  a  group  of  substitutions  is   trans- 
formed with  rrsjtcrt  to  (mi/  substitution   whatever,  the  transformed 

siibsfifiit/n,,*  form  a  gr-onj). 

Corollary  II.     The    two,   generally  different,   substitutions 
8a8fi  and  *3.sa  are  similar.     Forsa80=8p   l(s/sSa)s^.. 


MULTIPLE-VALUED    FUNCTIONS ALGEBRAIC    RELATIONS.  51 

Corollary  III.  The  substitution  saspsa~l  is  conjugate  to  sp 
ivith  respect  to  sa~\ 

Corollary  IV.  If  the  substitution  sa  is  of  order  r  and  if  sp 
be  such  that  its  7"'  <ind  no  lower  power  occurs  among  the  powers  of 
sa,  and  if  furthermore  the  conjugate  of  sp  with  respect  to  sa  is  a 
power  of  Sp,  then  the  SV  miles/  group  containing  sa  and  sft  is  of  order 
q-r.(cf.  §§37,  38,  Chapter  II). 

Corollary    V.      All    substitutions    which    transform    a    given 

substitution  s  into  its  powers,  sa,form  a  group. 

Corollary  VI.  All  substitutions  which  transform  a  given 
group  into  itself  form  a  group. 

Corollary  VII.  If  two  substitutions,  or  tiro  groups,  are 
similar,  substitutions  can  al trays  be  found  which  transform  the  one 
into  the  other.  In  the  case  of  two  substitutions  the  transforming 
substitution  is  found  at  once  from  §  46.  In  the  case  of  groups,  we 
hare  only  to  construct  the  corresponding  functions  and  determine 
the  substitution  ff{  which  converts  the  one  into  the  other. 

Corollary  VIII.  Two  powers  sa  and  s13  of  the  same  substi- 
tution are  similar  when,  and  only  when,  a  and  /3  hare  the  same 
greatest  common  divisor  with  the  order  of  s. 

£  4^  •  We  turn  now  to  a  series  of  developments  relating  to  the 
existence  of  certain  special  types  of  groups  analogous  to  those  of 
§  39,  Chapter  II. 

Given  any  group  G  of  order  g,  let  Hx  of  order  /*,  and  Kt  of  order 
A.'i  be  subgroups  of  G,  and  let  cx  and  4'\  be  functions  belonging  to  H1 
and  AT,  respectively.     These  functions,  on  being  operated  on  by  all 

the  substitutions  of   G,  take  respectively  ^— =/;„and-^-  =  fc„  values 
in  all  (§  43,  Corollary);  let  these  be  denoted  by 

c,.  c.,,  .  .  .  ch     and    c''n  c\,  ...<.',  . 

The  group  of  any  one  of  the  functions  </■„  will  be  Ka  =  cra ~lKlaa, 
where  <ra  is  any  substitution  of  G  which  converts  </-,  into  4'a  ■ 
We  form  now  the  entire  system  of  values 

an  +  M'„      (a  =  1,2,...Ao;  a*  =  1,2,  . . .  k0), 


52  THEORY    OF    SrBSTITUTIONS. 


,: 


where  a  and  b  are  arbitrary  parameters,  and  divide  these     •'     func- 

tions  into  classes,  such  that  al]  the  functions  of  each  class  proceed 
from  any  one  among  them  by  the  operations  of  O. 

If  a  fx  +  6  (pa  be  one  of  the  values  above,  and  if  we  apply  to  it 
all  the  substitutions  of  6?,  the  resulting  values  are  not  necessarily  all 
distinct.  In  particular  some  of  them  may  coincide  with  the  given 
value.  The  number  of  the  latter  is  equal  to  the  number  of  substi- 
tutions common  to  H1  and  Ka=  t^'Iv^.  Let  this  number  be  da. 
Then  all  the  g  values  arising  from  a  c,  -f-  6  0a  will  coincide  in  sets  of 
da  each,  as   is  easily  seen.     The  number  of    distinct  values    thus 

obtained  is  therefore  — . 

(la 

If  these  do  not  exhaust  all  the  possible  values  <i  y>\  +  b  c'a.  let 
dc^-^b^r  be  any  remaining  value.  Then  in  the  same  class  with 
this  belongs  also 


&■ 


a  <f<r<r-  -  +  &  v'tct   i  =  a  Cj  -f  b  <!'$ . 
From   the  latter   value  we  can,  as  before,  deduce  a  class  contain- 
ing: in  this  case-V-  distinct  values,  where  ds  is  the  number  of  substi- 
°  dp 

tutions  common  to  Hx  and  Kp  =  <rf  lK}  <?$ . 

0 

g~ 

Proceeding  in  this  way,  we  must  finally  exhaust  all  the     '       val- 

ues  of  the  functions  a  eA  +  b  </y  •     Writing  then  the  two  numbers  of 
values  equal  to  each  other,  we  have,  after  dividing  through  by  g , 

where  m  denotes  the  number  of  classes  of  values  of  a  <f\  +  b  tp^  with 
respect  to  the  group  G.      Since  hx  is  a  multiple  of  every  da ,  we  may 

write  -j-=fa,  and  consequently 
cia 

B)  -1=/,+/,+  ...+/,,,, 

where  the/'s  are  all  integers.  * 

§  49.     From  Theorem  V  of  §  43  it  follows  as  a  special  case  that 
if  a  group  contains  a  substitution  of  prime  order  j>,  the  order  r  of 

•Formulas  A)  and  IS)  were  obtained  by  G.  Frobeuius,  Crelle  01.  p.  281.  as  an 
extension  of  a  result  given  by  the  Author,  Math.  Annalen  XII!. 


MULTIPLE -VALUED  FUNCTION'S  —  ALGEBRAIC  RELATION^.       ~>:' 

the  group  is  a  multiple  of  p,  and  if  a  group  contains  a  subgroup  of 
order  }>a  where  p  is  a  prime  number,  the  order  of  the  group  is  a  mul- 
tiple of  pa.  By  the  aid  of  the  results  of  the  preceding  Section  we 
can  now  also  prove  the  converse  proposition: 

Theorem  IX.  If  pa  be  the  highest  power  of  the  prime  num- 
ber p  which  is  a  divisor  of  the  order  h  of  a  group  H,  then  H  con- 
tain* subgroups  of  order  pa.  * 

In  the  demonstration  we  take  for  the  G  of  the  preceding  Sec- 
tion the  symmetric  group,  so  that  g  =  n\ .  For  Hx  we  take  the  pres- 
ent group  H,  and  for  Kt  the  group  of  order  pJ  of  §  39,  Chapter  II, 
p'  being  the  highest  power  of  p  which  is  a  divisor  of  n ! .  The 
formula  B)  of  §  48  then  becomes 

The  left  member  of  this  equation  is  no  longer  divisible  byjp;  con- 
sequently there  must  be  at  least  one  f$  =  —  which  is  also  not  di- 

dp 

visible  by  p ;  that  is  dp  is  divisible  by  pa,  and  therefore  H  and  Kp, 
the  latter  being  a  conjugate  of  K,  have  exactly  pa  substitutions  in 
common,  j"     These  form  the  required  subgroup  of  H. 

Corollary.  At  the  same  time  it  appears  that  the  group  K  con- 
tains among  its  subgroups  every  type  of  groups  of  order  pi.  For 
ire  need  only  take  any  group  of  order  pv  for  H  iii  tlie  above  demon- 
stration. 

§  50.     The  last  theorem  admits  of  the  following  extension : 

Theorem  X.     If  the  order  h  of  a  group  H  is  divisible  by 

pP,  tlien  H  contains  subgroups  of  order  p&. 

The  proof  follows  at  once  from  Theorem  XI,  as  soon  as  we  have 
proved 

Theorem  XI.  Every  group  H  of  order  p0-  contains  a  sub- 
group of  order  pa_1. 

The  corollary  of  the  preceding  Section  permits  us  to  limit  the 

•Oauchy,  loc.  cit..  proved  this  theorem  for  the  case  a  =  1.  The  extension  to  the 
case  of  any  a  was  given  by  L.  Sylow,  Math.  Annalen  V.  pp.  .">S4-59L 

tFor  every  subgroup  of  K,  and  consequently  every  subgroup  of  K$.  has  for  its 
order  a  power  of  p. 


5  \  THEORY    OF    SUBSTITUTIONS. 

proof  to  the  case  of  groups  of  order  pa  which  occur  as  subgroups  in 
the  group  of  §  39,  Chapter  II.  The  group  K  =  Kf  there  obtained 
was  constructed  by  the  aid  of  a  series  of  subgroups  (§  40) 

1,  ISTj ,  K21  . . .  K\ ,  K\+1 ,  . . .  K,_ , , 
of  orders 

1,  p\  p\    •••  p\  PA+1,   ■••  Pf~\ 

every  one  of  which  is  contained  in  the  following  one.  If  the  group  H 
occurs  in  this  series,  the  theorem  is  already  proved;  if  not,  then  let 
.Ka-i  be  the  lowest  group  which  still  contains  H.  KK  then  does  not 
contain  all  the  substitutions  of  H.  We  apply  now  the  formula  B) 
of  §  48  to  the  groups  &TA  + , ,  KK ,  and  H,  taking  these  in  the  place  of 
G,  K, ,  and  H.     We  find 

P=/i+/i  +  ...+/-. 

This  equation  has  two  solutions,  since  the/'s,  being  divisors  of 
h  =  pa,  are  powers  of  p:  either  we  must  have  f\  =/8=  ...  =1  and 
w  —p,  or  else  m  =  1  and  j\  =  p.  In  the  former  case  it  would  follow 
that  h  =  du  i.  e»,  that  H  is  a  subgroup  of  KK,  which  is  contrary  to 
hypothesis.  Consequently/,  =  p,  i.  e.  H  and  A"A  have  a  common  sub- 
group of  order  j)a~\     This  is  the  required  group.  * 

To  Theorem  X  we  can  now  add  the  following 

Corollary.  Every  group  of  order  pa  ■  p^  jp2aj  .  .  .  can  be  con- 
structed by  the  combination  of  subgroups,  one  of  each  of  the  orders 
pa,Piai,p2°*,  .  .. 

A  smaller  number  of  subgroups  is  of  course  generally  sufficient. 

A  further  extension  of  the  theory  in  this  direction  is  not  to  be 
anticipated.  Thus,  for  example,  the  alternating  group  of  four  ele- 
ments, which  is  composed  of  the  twelve  substitutions 

1,    (.C|.»'_,)  (./" ..(',  I.    I  .'Vl'    )  I .''_,.«',  ),    (.!',. '')  M  •''_>•'':  ). 
'   '    •*V*':i/5  '  ■' V  j '•*%,)>         V^1**V  i  '"  '■'_■'  \'i)) 

'  ' '  •' '  •' '. )i       v^r^^y?        v^W**3/j        (.*'■',''  ), 

has  no  subgroup  of  order  6. 

^  51.  We  insert  here  another  investigation  based  on  the  con- 
struction of  tables  as  in  §  41. 

Let  H be  a  group  of  order  //  affecting  the  n  elements  .r, ,  .»•_,,  ...... 

■  G.  Frobenlus:  Crelle  01.  p.3£ 


MULTIPLE-VALUED    FUNCTIONS —ALGEBRAIC    RELATIONS.  55 

From  these  n  elements  we  arbitrarily  select  any  k,  as  xu  .'•_.,  . . .  x  , 
and  let  H'  be  the  subgroup  of  H  which  contains  all  the  substitu- 
tions of  the  latter  that  do  not  affect  .*,,  x2,  .  .  .  .<•, .  Suppose  In! 
to  be  the  order  of  H',  and  /,  =  1  L, .  .  .  t,,'  to  be  its  several  substitu- 
tions. We  proceed  then  to  tabulate  the  substitutions  of  H  as  fol- 
lows: 

Given  any  substitution  s„  of  H,  suppose  that  this  converts 
•<-,,  .r,,  .  .  .  .<■,.  into  xaj,xa, .  .  .  xah,  in  the  order  as  written.  Then  all 
the  substitutions 

also  convert  ,r, ,  .v.,  .  .  .  xk  into  x\x,  x^,  .  .  .  -<'«,,  respectively,  and  these 
are  the  only  substitutions  of  H  which  have  this  effect.  We  take 
these  various  sets  of  h  substitutions  for  the  lines  of  our  table,  which 
is  accordingly  of  the  form 


1, 

fc, 

t,,       ■ 

•  •      *W  i 

"2  j 

t2S-i , 

t3S%, 

,  .      fvs2s 

T) 

s3, 

toS3, 

'3*3  J       • 

•    •       'It' 8-3) 

Sju, 

*  -,,SV  > 

*3SM  J       • 

.  •     *ft'V 

The  substitutions  of  the  table  are  obviously  all  different,  and  conse- 
quently p.  h'»=h. 

Again,  suppose  that   r,  is  any  substitution  of  H  which  contains 
among  its  cycles  one  of  order  k,  say 

(1)  to1  =  (.<!.(•,.(■.  .  .  .  as*). 
Then  all  the  (necessarily  distinct)  substitutions 

(2)  v1,tiv1,t3v1,...th-vJ 

will  contain  the  same  cycle  (1)  and  these  will  be  the  only  substitu- 
tions of  H  which  contain  this  cycle.  We  wish  now  to  determine  how 
many  substitutions  of  H  contain  either  the  cycle  (1)  or  any  cycle 
obtainable  from  (1)  by  transformation  with  respect  to  the  substitu- 
tions of  H,  say 

Now  since   all  the  substitutions  of  the  same  line  of  T)  convert 
the  elements  of  the  cycle  (1)  into  one  and  the  same  system  of  ele 
ments,  it  follows  that  if  we  write 


56  THEORY    OF    SUBSTITUTIONS. 

8a-1V18a  =  Va      (o=l,  2,  .  .  .  ft), 

where  each  sa  is  the  same  as  that  of  the  table  T),  then  all  the  conju- 
gates of  the  cycle  ( 1)  which  occur  in  the  substitutions  of  H  are  con- 
tained in  r, ,  v2 , . . .  Vp.  Suppose  the  notation  so  chosen  that  o>a  is 
contained  in  r„.  If  now  we  denote  the  substitutions  of  H  which  do 
not  affect  .ca.  ,.<•„,,  .  .  .  a ■„, .  i.  e.  those  of  the  group  8a~  lH'sa  =  Ha  by 

1      /  (a)     /  (o)  f  '(a) 

and  by  right  hand  multiplication  by  y„  form  the  line 

(3)  va,  Va<ca,  tr}ra.  ...  th>va, 

then  (3 )  contains  all  the  substitutions  of  H  which  involve  the  cycle 
<oa.     The  fi  lines  of  the  following  table 

r, ,    t  ,vx,        1  ,i\ ,        ...    ti/i'i . 
y2,    t^v2,     tsV)v2,    ...    t       r  . 

1 II ' 


therefore  contain  all  the  required  substitutions. 

The  question  then  arises,  how  many  of  the  lines  of  T0)  give  the 
same  cycle;  for  example,  in  how  many  lines  the  cycle  (1)  occurs.  If 
this  cycle  occurs  in  t?T  =  sT— 1u1sT,  then  sT  must  permute  the  elements 
a?,,  a?2,  .  .  .  •*';,  cyclically,  and  must  therefore  contain  a  power  of  (1) 
as  a  cycle.  Consequently  we  must  have  sT  equal  to  one  of  the  sub- 
stitutions vx,  v*,Vi,  .  . .  vf~ 1  or  one  of  these  multiplied  by  some  tv. 
But  the  substitutions  vx ,  v*,  .  .  .  vf  ~ '  belong  to  different  lines  of  the 
table  T0).  It  appears  therefore  that  the  ft  lines  of  T0)  coincide  in 
sets  of  k  each.     We  have  then 

Theorem  XII.  Every  individual  cycle  of  order  k  which 
occurs  in  (2),  and  consequently  every  one  which  occurs  in  H,  gives 
rise  by  transformation  with  respect  to  all  the  h  substitutions  of  H, 

to      cycles.     The  h'  distinct  conjugate  cycles  of  order  k  which  occur 
k 

in  H  therefore  give  rise  to  —  =  —  cycles.  The  number  of  letters  oc- 
curring in  these  cycles  is  therefore  equal  to  h,  the  order  of  H.  From 
this  it  follows  that  the  number  of  letters  in  all  the  cycles  of  order  k 
is  a  multiple  of  the  order  of  H.  The  multiplier  is  the  number  of 
sets  of  non-conjugate  cycles  of  order  k. 


MILTIPLE-VALUED    FUNCTIONS — ALGEBRAIC    RELATIONS.  57 

Corollary.  The  number  of  elements  which  remain  un- 
changed in  the  several  substitutions  of  H  is  a  multiple  of  the  order 

0 

of  H.  If  every  elenu  nt  can  be  replaced  by  every  other  one  by  tht 
substitutions  of  H,  this  number  is  exactly  equal  to  the  order  of  H* 

Example.     Consider  the  alternating  groups  of  four  elements. 

(Xi)  (U'oXj.i'j),  (•'' J  (.'','' .i'j).      (.f.|  (.<■,.<•,.  fj ).     [Xi)  [XiXpCs), 

^.r,  )(•*'_,.  r,.r3j,  (,•''•_•)  [X\XiX  I,     (•'';)(  .'V'4' j '•    '  •' \ )  1  ■' V  •' .  '■ 

Here  the  number  of  cycles  with  one  element  is  12,  which  is 
equal  to  the  order  of  the  group.  The  number  of  elements  which 
occur  in  cycles  of  the  second  order  is  also  12.  But,  for  A;  =  3,  the 
number  of  elements  is  24  =  2  •  12.  Correspondingly  it  is  readily 
shown  that  the  group  permits  of  replacing  any  element  by  any 
other  one;  that  the  cycles  of  order  2  are  all  conjugate;  but  that 
the  cycles  of  order  3  divide  into  two  sets  of  four  each : 

(ry*    ry*    ry*    \  { ry*    ry*    ry    \  /  ry,    ry*    ry*    \  I  ry*    ry*    ,y\    \ 

•A  ]*A  ot*.  3  I,  lttjt*->j(A^I,  I  tA.  jtX,^t4-2/y  \       -      4      3/5 

(at*    ry*    ry*    \  (  ry*    ry*    /Y*    \  I  ~Y*    'Y*    'Y*     I  I   'Y*     Y*    'Y1    \ 

the  second  set  being  non-conjugate  with  the  first. 

§  52.  We  return  now  to  the  table  constructed  in  §  45.  This 
table  did  not  possess  the  last  of  the  four  properties  noted  in  §  41 ;  the 
substitutions  of  one  line  were  not  necessarily  all  different  from  those 
of  the  other  lines.  For  every  group  certainly  contains  the  identical 
substitution  1,  which  therefore  occurs  /'  times;  and  again  in  the 
example  of  §  46  three  other  substitutions 

occur  in  each  of  the  three  groups.     We  have  now  to  determine  in 
general  when  it  is  possible  that  one  and  the  same  substitution  shall 
occur  in  all  the  groups  G^G-,,  .  .  .  Gp  belonging  respectively  to  the 
several  values  ft,  <f...  .  .  .  <fp  of  <p.     We  shall  find  that  the  example 

just  cited  is  a  remarkable  exception,  in  that  there  is  in  general  no 
substitution  except  1  which  leaves  all  the  values  of  a  function  un- 
changed, f 

*Iu  connection  with  thi>  Section  Cf.  Frobenius,  Crelle  CI.  p.  273.  followed  by  an 
article  by  the  Author,  ibid.  CIII  p.  321. 

tL.  Kronecker:    Monatsberichte  d.  Berl.  Akad.  IsT'J.  208. 


*iS  THEORY    OF    SUBSTITUTIONS. 

If  we  apply  to  the  series  of  functions  y,,  <pa,  .  .  .  cp  any  arbitrary 
substitution  <r,  we  obtain 

V  (J  «     V  (T-.  IT  •     T  <T  ;  <T  J       •••       V  (Tp  (T  • 

These  values  must  coincide,  apart  from  the  order  of  succession,  with 
the  former  set,  for  cr, ,  c,,  ...  crp  are  all  the  possible  values  of  tp,  and 
the  p  values  just  obtained  are  all  different  from  one  another.  The 
groups  which  belong  to  the  latter 

(jxGxn,   <7~lG.,<7,  <r~1Qtff, . . .  ff~1Gp<t 

are  therefore  also,  apart  from  the  order  of  succession,  identical  with 
G-',.  G,,  G,.  .  .  .  Gp,  that  is,  the  system  of  the  G%  regarded  as  a  whole, 
is  unaltered  by  transformation  with  respect  to  any  substitution 
whatever.  If  now  we  denote  by  H  the  group  composed  of  those 
substitutions  which  are  common  to  Gx ,  G-,,  .  .  .  Gp,  then  H  is  also  the 
group  of  those  substitutions  which  are  common  to  <r  ~ '  Gx  <r,  <>~l  G,  v, 
...a~2Gp<r.  But  the  latter  group  is  also  of  course  expressed  by 
v~yH<>;  consequently  we  have 

<T~lH>7  =  H; 

that  is,  the  group  H  is  unaltered  by  transformation  with  respect  to 
any  substitution;  it  includes  therefore  all  the  substitutions  which 
are  similar  to  any  one  contained  in  it. 

We  proceed  now  to  examine  the  nature  of  a  group  H  of  this 
character.  We  consider  in  particular  those  substitutions  of  H 
which  affect  the  least  number  of  elements,  the  identical  substitution 
excepted.  It  is  clear  that  these  can  contain  only  cycles  of  the  same 
number  of  elements,  since  otherwise  some  of  their  powers  would 
contain  fewer  elements,  without  being  identically  1. 

We  prove  with  regard  to  these  substitutions,  first  that  no  one  of 
their  cycles  can  contain  more  than  three  elements.  For  if  H  con- 
tains, for  example,  the  substitution 

and  if  we  take  a—  (xtxt),  then,  since  *~  *H <r  =  H,  the  substitution 

will  also  occur  in  H.  Now  s,  only  differs  from  8  in  the  order  of  the 
two  elements  a?8  and  a*4.  Consequently  their  product,  which  must 
also  occur  in  H,  since  if  is  a  group, 


MULTIPLE-VALUED    FUNCTIONS ALGEBRAIC    RELATIONS.  59 

g  .  ,s'j  ~  {.('.j j  yOC^iJC^  .  .  .  )  ... 

will  certainly  not  affect  the  element  xa,  but  cannot  be  the  identical 
substitution,  because  it  contains  at  least  the  cycle  (.'•1*,4  .  .  . ).  This 
product  therefore  affects  fewer  elements  than  s,  which  is  contrary  to 
hypothesis. 

Secondly  we  prove  that,  if  n  >  4,  the  substitution  of  H  which 
affects  the  least  number  of  elements  cannot  contain  more  than  one 
cycle.     For  otherwise  H  would  contain  substitutions  of  the  form 

and  therefore  the  corresponding  conjugate  substitutions  with  respect 

to  n  —  (.'•,.(•-) 

Sa   =  (^V'j  )'■''.■'':,)•••  ,       $p    =  (•<',. <\.<'.  |  |.r  ,■',.''.  )  .  .  . 

Consequently  the  corresponding  products 

8a~l8a'=  O,)  (X2)  (,C,  ...)...,    8p~V  =  fa)  ('<'-')  fo)  (•t'r'V,).  •  ., 

which  are  not  1,  but  affect  fewer  elements  than  s,  must  also  occur  in 
H,  which  would  again  be  contrary  to  hypothesis. 

If  then  n  >  4,  either  H  consists  of  the  identical  substitution  1, 
or  if  contains  a  substitution  (■rtl,rv),  or  a  substitution  («rA^Va\  )•  In 
the  second  case  H  must  contain  all  the  transpositions,  that  is  H  is 
the  symmetric  group.  In  the  third  case  H  must  contain  all  the  cir- 
cular substitutions  of  the  third  order,  that  is  H  is  the  alternating 
group.     (Cf.  §§  34-35). 

Returning  from  the  group  H  to  the  group  G,  it  appears  that  if 
Gu  G2,  .  .  .  Gp  have  any  substitution,  except  1,  common  to  all,  then 
either  the  second  or  the  third  case  occurs.  H,  which  is  contained  in 
6r,  includes  in  either  case  the  alternating  group;  G  is  therefore 
either  the  alternating  or  the  symmetric  group,  and  p  =  2,  or  p  =  l. 

If,  however,  n  =  4  we  might  have,  beside  s,  =  1,  another  substi- 
tution 

in  the  group.     With  this  its  conjugates,  of  which  there  are  only  two, 

must  also  occur.  The  group  H  cannot  contain  any  further  substitu- 
tion without  becoming  either  the  alternating  or  the  symmetric  group. 
We  have  then  the  exceptional  group 


6<>  THEORY    OF    SUBSTITUTIONS. 

H=[s1  =  1,  S2,  s   ,  8+], 

and  this  actually  does  transform  into  itself  with  respect  to  every  sub- 
stitution. Returning  to  the  group  G  it  follows  from  §  43,  Theorem 
II.  that  the  order  of  G  is  a  multiple  of  that  of  H,  that  is,  a  multiple 
of  4;  again  from  Theorem  II  the  order  of  G  must  be  a  divisor  of 
4!  =  24.  The  choice  is  therefore  restricted  to  the  numbers  4,  8,  12, 
and  24.  The  last  two  numbers  lead  to  the  general  case  already  dis- 
cussed where  ,"=2.  or  1.  The  hrst  gives  G=  H,  />  =  6,  and  for 
example, 

c'j  =  (.('rr_,  T  •••';;•  I',)         (•<'). *':;  T  ■l':-'\)i    f:  —  \X{X2  -J-  #3X4)         (-'Vi    1    •'.•■^3) 

C'  I  ./   j    I    1  -~\—  yCcpJCi  f  (  .I'j./'i  - J      X ...{  ;j  ),      C  ^  \  .1  j,( ' ..  — |—  .1  .,.1  if  \  ,t  j.f  .,      I      •';;*'   j  ) 

c-  =  ( ,cvi'i  -\-  .<'_.■'';; )       (.r|.r._,  -\-  .<•..<')),    <pe  =  (•<',.<',  -|-  .  r_,. » '., )       ( .(■,.»'..  -\-  ■  ''_.-r4'  • 

In  the  second  case,  r  =  8,  G  contains  H  as  a  subgroup.  To  obtain 
G  we  must  add  other  substitutions  to  those  of  H.  None  of  these 
can  be  cyclical  of  the  third  order,  for  in  this  case  we  should  have 
r  =  12  or  24.  If  we  select  any  other  substitution,  we  obtain  the 
group  of  §  40,  which  is  included  among  those  treated  in  §  39.  For 
this  group  p  =  3,  and,  for  example, 

Vl   •<  1«  i'  T^  «*U'l  4  5  ?2  «*-l«*,3  ~  "■  'J-*  4>  T8  '"1-X4      I  -  ■ 

Theorem  XI.     If  n  >  4  Mere  is  ?io  function,  except  the  al- 
ternating and  symmetric  functions,  of  which  all  the  p   values   are 
unchanged  by  the  same  substitution  (excluding  the  case  of  the  identi- 
cal substitution).    Ifn  =  4,  all  the  values  of  any  function  belong 
ing  to  the  same  group  with 

<s  =  (xxx2  +  x%x^  —  {x\Xz  +  x2.t4)  or  with  C'  =  xvr ..  -J-  x 

are  unchanged  by  the  substitutions  of  the  group 

H=[l,  (.»•,.♦■.,)(.*•,.»•,),  (..•..,■.)(•.,•,.»•,),  (.»•,.»■, I  (.<yr;j)]. 


§  53.  We  have  thus  far  examined  the  connection  between  the 
values  of  a  /'-valued  function  from  the  point  of  view  of  the  theory  of 
substitutions.  We  turn  now  to  the  consideration  of  the  algebraic 
relations  of  these  values. 

We  saw  at  the  beginning  of  the  preceding  Section  that  the  sys- 
tem of  values  e,,  c,,  .  .  .  <fp  belonging  to  a  function  c  is  unchanged 


MULTIPLE- V\  I.I  TH    FUNCTIONS  — ALGEBRAIC    RELATIONS. 


61 


as  a  whole  by  the  application  of  any  substitution,  only  the  order  of 
succession  of  the  several  values  being  altered.  All  integral  symmet- 
ric functions  of  ft,  ft-,  .  .  .  cr„  are  therefore  unchanged  by  any  substi- 
tution, and  are  consequently  symmetric  not  only  in  the  cr's  but  also 
in  the  X\B,  They  can  therefore  be  expressed  as  rational  integral 
functions  of  the  elementary  symmetric  functions  cA  of  the  .rA's.  If 
we  write  then 

S  (ft  I  =  <Pl  +  <Pi  +  ■  •   •  +  V'p    =     #1  ''•;  ■  •' '•  .  I. 

Sly',  ft)  =  Fift+?J?"B+  •  •  •        =    Riic^C^  .  .  .  C„), 

S(?i?>2  •   •   •   Pp)    =  v'ir'jV':;  •   •   •   V'p  =     ^p(Cn  Co,    .  .  .C     ). 

the  it's  are  the  coefficients  of  an  algebraic  equation  of  which 
ft .  ft,  .  .  .  <sp  are  the  roots. 

Theorem  XII.     The  <>  values  ft,  ft, . . .  ft,   of    a   p-valued 

integral  rational  function  <p  are  the  roots  of  an  equation  of  degree  p 

tpp—RrfP-1  +  RsfP-*— .  ..  ±RP  =  <> 

the  coefficients  of  which  are  rational  integral  functions  of  the  ele- 
mentary  symmetric  functions  cn  c,,  ...  cnof  the  elements  xnx2,  ...  x'„. 

^  hi.     As  an  example  we  determine  the  equation  of  which  the 
three  roots  are 

p,  =  xxX ,  +  XaXt ,     ft  -  .rrr,  +  x.2Xi ,      ft  =  avr,  -f  x2x3 , 
where  a?,,  .<•_,,  cc3,  sc4  are  themselves  the  roots  of  the  equation 
/(.-•)  =  x4  —  etx3  +  c2x2  - czx  +  c4  =  0. 

We  find  at  once 

?i+?2  +  ?3=  SUv\)  =  r,; 
and  again,  by  §  10,  Chapter  I, 

<fi<P2  +  ftfa  +  fsfi  =  S  (.rr'r,c3)  =  '•  c4  +  /Sc^g  + ;  c.,\ 
The  numerical  coefficients  a, , ?,  /-  are  readily  found  from  special  ex- 
amples.    They  are  a  =  — 4,  /?  =  1,  /-  =  0.     Hence 

P1P2  +  V2V3  + Wri  =  C,C3  — 4c4. 
Finally 

C  -  wr  1  -    .  0\  it  i    JCn  lK  3     I      J       tX  jit  oil  9*(  i  Outi     I 

==  Cj  C4        4CoC(  -}-  c3 , 

Accordingly  the  required  equation  is 


62  THEORY    OF    SUBSTITUTIONS. 

f(<p)  =  <  —  <•#-  +  (c,c8  —  4c4)i<>^-(c,ac4— 4e2c4+c82)  =  0. 

We  examine  the  discriminant  of  this  equation,  i.  e.,  of  its  three 
roots.  To  determine  this  function  it  is  not  necessary  to  employ  the 
the  general  formula  obtained  in  §  10,  Chapter  I.     We  have  at  once 

tpy  —  if,  =  (*j  —  xt)  (x2  —  a  .. 

tpa  —  <px  =  (xx —  X3)  (a?a—  .',). 

and  consequently,  if  we   denote   the  discriminant  of  the  c's  by  -L 
and  that  of  the  .rA's  by  J, 

We  observe  here  therefore  that  the  discriminant  of  an  equation 
of  the  fourth  degree  can  also  be  represented  in  the  form  of  the  dis- 
criminant of  an  equation  of  the  third  degree.  A  more  important 
consideration  is  that  the  special  theorem  here  obtained  can  be  gen- 
eralized in   another  direction,  to  which  we  next  turn  our  attention. 

§  T»5  We  start  out  from  the  table  of  §  41.  If  <f  is  not  single- 
valued,  the  first  line  of  this  table,  i.  e.,  the  group  Gx  belonging  to  cr, 
does  not  contain  all  the  transpositions.  If  a  transposition  (xaXp) 
occurs  in  the  second  line,  it  results  from  the  construction  of  the 
table  that  (x^i-p)  converts  c,  into  ?.,.  If  therefore  £Ca=  Xp,  then 
c,  =  (f.,  also,  and  consequently  cr,  —  cr,,  since  it  vanishes  for  x„  =  Xp, 
is  divisible  by  xa —  xp. 

If,  then,  any  transposition  (xaXp)  does  not  occur  in  the  group  G 
of  e,,  one  of  the  differences  cr, — crA  (A=  2,3,  .  .  .  p)  is  divisible  by 
a  factor  of  the  form  xa  —  Xp . 

Now  there  are  in  all         t.         transpositions  of  h  elements.   If  the 

first  line  of  the  table,  i.  c,  (lx ,  contains  exactly  q  of  these,  then  the 

//  (  "       1 ) 
other  lines  contain   ^ </.    The  product  (cr,  —  crjfc.',  -    c ,)  .  .  . 

Yldl- 1  I 

(cr, —  cp)  is  therefore  divisible  by ~ q   different    factors    of 

the  form  xa —  Xp,  and  therefore  by  their  product. 

Instead  of  starting  out  with  the  value  cr,,  we  might  equally  well 
have  taken  cr.,.     Since  the  group  (>',  —  ff2~1G1ff2  l>elonging  to  <s2  =  c^ 


MULTIPLE-VALUED    FUNCTIONS ALGEBRAIC    RELATIONS.  03 

is  similar  to  the  group  Gx ,  it  also  contains  </  transpositions,  and  the 

ii(  a      1 ) 
product  ( <f .,  —  ?,)  (<f  ■,  —  <f3)  .  .  .  ( 9i  —  f  p)  is  also  divisible  by ^—      -  q 

factors  of  the  form  xa — a?«.     The  same  reasoning  holds  if  we  start 
with  cr:j,  <pi . .  .  cp.     If  we  multiply  the  separate   products  together, 

we  find  that 

p(p_l)a.=p 

>  =  l 

is  divisible  by  the  product  of /<  %J         — g    factors  xa- — Xp.      But 

since  J0  is  symmetric  in  the  ,rA's,  the  presence  of  a  factor  ,ra  —  xp 
requires  that  of    every  other   factor  xy  —  x&,  and  consequently  of 

J  =   //  (.'-a — Xp)',  the   discriminant  of  f(x).      Suppose  that  J'  is 
a> 

the  highest  power  of  J  which  is  contained  as  a  factor  in  Jo,  then,  as 

J  contains   n{n —  1)  factors  xa  —  Xp,  and  consequently  J'  contains 

n(n  —  Y)t  such  factors,  we  must  have 


n 


(n  —  !)*>/>[ g gj 


t  >  t        M 


=  2       n(n  —  1)' 

The  number  f  can  be  0  only  when  g  = ^ ,  that  is,  when  all 

the  transpositions  occur  in  6r,.  <p  is  then  symmetric  and  p  =  1. 
Again  q  can  be  0  only  when  G  contains  no  transposition.  One  of 
the  cases  in  which  this  occurs  is  that  where  G  is  the  alternating 
group  or  one  of  its  subgroups. 

Theorem  X  T I  \    Jf  c  is  p-valued  function  of  the  n  elements 

<■, .  .r. r„.  the  group  of  which  contains  </  transpositions,  the  dis- 
criminant J0  of  the  p  values  of  <f  is  divisible  by 

xP(\ «_ ) 

J'  \2      n(n  —  \y  > 

If  (pis  not  symmetric,  the  exponent  of  J  is  not  zero.  If  the  group 
of  <s  is  contained  in  the  alternating  group,  q  is  zero. 

All  multiple-valued  functions  therefore  have  some  of  their  rallies 
coincident  if  tiro  of  the  clement*  X\  become  equal. 


SDL 


64  THEORY    OF    SUBSTITUTIONS. 

We  perceive  now  why  it  was  impossible  (§  32)  to  obtain  n!- valued 
functions  when  any  of  the  elements  .rA  were  equal  (Cf.  also  §  104). 
jj  56.     Returning  now  to  the  equation  ($53)  of  which  the  roots 
are  ?,,?,,  .  .  .  <Pf, 

we  endeavor  to  determine  whether  and  under  what  circumstances 
this  equation  can  become  binomial,  i.  e.,  whether  there  are  any 
//-valued  functions  whose  pih  powers  are  symmetric.     For  p  =  2,  we 

already  know  that  <s  —  \f  J  satisfies  this  condition.  In  treating  the 
general  case  we  will  assume  that,  if  the  required  function  tp  contains 

any  factors  of  the  form  \/  J ,  these  factors  are  all  removed  at  the 
outset.     If  the  resulting  quotient  is  </',  so  that 

then,  since  cr>  and  (x/j)1^  are  both  symmetric,  v''p  is  symmetric 
also.     We  write  then 

If  (t'i  be  any  root  of  this  equation,  and  if  to  be  a  primitive  (2p)lb  root 
of  unity,  then  all  the  roots  are 

</'i,   to<Pi,    a»Vi,  •  ■  •  <»~p~\\< 
and  consequently 

J,p  =  <r\ »(1  — ^(l—V...  (-*-"  — a^-1)'. 

From  Theorem  XIII  this  discriminant  must  be  divisible  by  J,  unless 
t''  is  itself  symmetric.  But  the  factors  containing  w  are  constant 
and  therefore  not  divisible  by  J,  and  by  supposition  </',  does  not  con- 
tain \/  J  as  a  factor.  Consequently  </',  is  symmetric,  and  we  have, 
according  as  '/  is  odd  or  even, 

<p  =  S,     <p  =  S  \/J. 

Theorem  XIV.  If  the  n  elements  x11x2t  . . .  xnare  inde- 
pendent, the  only  unsymmetric  functions  of  which  a  power  can  be 
symmetric  are  the  alternating  functions. 

6  57.  On  account  of  the  importance  of  this  last  proposition  we 
add  in  the  present  and  following  Sections  other  proofs  based  on 
entirely  different  grounds. 


MULTIPLE-VALUED    FUNCTIONS  —  ALGEBRAIC    RELATIONS.  65 

If  oj  is  a  primitive  ,"th  root  of  unity,  and  if  c,  is  any  root  of  the 
equation 

then  all  the  roots  of  this  equation  are 


jp-1 


<-- 


Since  the  <«'s  are  constants,  all  the  values  of  <f  have  the  same  group. 

From  Theorem  XI,  this  must  be,  for  n  ^  4,  either  the  symmetric  or 

th^  alternating  group,  or  the  identical  operation  1.  The  first  two 
cases  give  p  =  1  or  2.  In  the  last  case  />  =  n ! .  All  the  values  of  a 
function  are  of  the  same  type,  and  consequently  there  are  substitu- 
tions which  transform  one  into  another.  Suppose,  in  the  case 
p  —  n\,  that  <r  converts  the  value  c,  into  (f2  =  (vc1-  then  ^A  converts 
c"!  into  taK<p},    Accordingly  the  series 

i,  <r,  <r ,  .  .  .  a 

consists  of  distinct  substitutions,  which  therefore  include  all  the  n\ 
possible  substitutions.  *  must  therefore  be  a  substitution  of  degree 
n  and  order  n ! .     Such  a  substitution  does  not  exist  if  n  >  2. 

The  case  n  =  -4  furnishes  no  exception.  In  this  case  the  group 
common  to  all  the  values  of  o  might  be  the  special  group  (Theorem 
XIII) 

U"  —  |_-t)  Kp^v^i)  Kph'El)}   (•'']•'':)  (  •t'2,l'i)i   \p^V^i)  ' '''j,':i)J  5 

c  would  then  be  a  six-valued  function,  and  there  must  be  a  substi- 
tution v  which  converts  cx  into  wc,  and  which  is  of  order  6.  But 
there  is  no  such  substitution  in  the  case  of  four  elements. 

§  58.  Finally  we  give  a  proof  which  is  based  on  the  most  ele- 
mentary considerations  and  which  moreover  leads  to  an  important 
extension  of  the  theorem  under  discussion. 

In  the  first  place  we  may  limit  ourselves  to  the  case  where  ,"  is  a 
prime  number.  For,  if  p=p-q,  where  p  is  a  prime  number,  it 
follows  from 

that  there  is  also  a  function  c'of  which  a  prime  power,  the  pxh,  is 
symmetric. 

If,  accordingly,  we  denote  by  <p  a  function  of  which  a  prime 
power,  the  _pth ,  is  symmetric   while  <p  itself  is  unsymmetric,    then, 


GO  THEORY    OF    SUBSTITUTIONS. 

since  the  group  of  <f  cannot  contain  all  the  transpositions  (§  34), 
suppose  that  a  =  (xaXp)  converts  9',  into  <pa,  where   ca  =9?,.     Since 

it  follows  that 

where  to  is  a  primitive  pth  root  of  unity.  If  we  apply  the  substitu- 
tion a  again  to  the  last  equation,  remembering  that  0s  =  1  and  that 
consequently  cv  =  <pu  we  obtain  the  new  equation 

Multiplying  these  two  equations  together  and  dividing  by  cr,  <pa ,  we 
have 

U>      =    1    , 

and  consequently,  since  p  is  a  prime  number,  p  =  2  and  <f  =  S  \/  J  • 
Having  shown  that  only  the  alternating  functions  have  the  prop- 
erty that  their  prime  powers  can  be  symmetric,  we  may  next  exam- 
ine whether  there  are  any  functions  prime  powers  of  which  can  be 
two-valued. 

Suppose  that  </>  is  multiple-valued,  while  its  qtix  power  is  two-val- 
ued, q  being  prime.  Then  there  is  some  circular  substitution  of 
the  third  order  it=  (xaXpXy),  which  does  not  occur  in  the  group  of  <f>, 
since,  if  this  group  contains  all  the  substitutions  of  this  form,  it 
must  be  the  alternating  group  (§  35).  Suppose,  then,  that  4'o  j  #1, 
but  that 

9'.ff«  =  <.''!*  =  Si +  $V^, 

since  <pq,  being  a  two-valued  function,  is  unaltered  by  a  circular  sub- 
stitution of  the  third  order.      We  must  therefore  have 

<!'■<,  —  <"4'\ » 
where  <»  is  not  1  and  must  therefore  be  a  primitive  qth  root  of  unity. 
If  we  apply  to  this  last  equation  the  substitutions  a  and   *',  and 
remember  that  <?'  =  1,  and  that  consequently  c'v  =  9'',,  we  obtain 

c'v-  =  o>4'ix 

Multiplying  these  three  equations  together  and  removing  the  func- 
tional values,  we  have 


MULTIPLE-VALUED    FUNCTIONS         AiGEBBAIC    RELATION-.  67 

If  now  we  assume  //  >  4,  then  the  group  of  4'  cannot  contain  all 
the  circular  substitutions  of  the  fifth  order,  (Theorem  X,  Chapter 
II).     If  r  is  one  of  those  not  occurring  in  the  group  of  <J;  then 

cV!-c\,  but 

cV  =  vV  =  <S  +  ^VJ. 
and  consequently,  if  <«  be  a  qth  root  of  unity  different  from  1, 

It  follows  from  this,  precisely  as  above,  that,  since  r"  =  1. 

and  consequently  at6  =  1,  g=  5. 

But  this  is  inconsistent  with  the  first  result.  It  follows  there- 
fore that  n  is  not  greater  than  4. 

Theorem   XVII.     If    n  >  4,    there    is   no  multiple-valued 

function  a  power  of  which  is  two-valued,  if  the  elements  .>■  are 
independent  quantities. 

§  59.  We  conclude  these  investigations  by  examining  for  u  "^  4 
the  possibility  of  the  existence  of  functions  having  the  property  dis- 
cussed above. 

The  case  n  =  2  requires  no  consideration.  In  the  case  n  =  3  we 
undertake  a  systematic  determination  of  the  possible  functions  of 
the  required  kind.     We  begin  with  the  type 

cr,  =  ax{  +  ,ix.,r  +  yx{, 

and  attempt  to  determine  «,  ,5,  y  so  as  to  satisfy  the  required  condi- 
tions. For  this  purpose  we  make  use  of  the  circumstance  that  some 
a  =  (xjXtfc-^)  converts  cx  into  wc,  (w3  =  1)  so  that 

tp9  —  ax/  +  (IxJ  +  yxf  =  «(«.r,'  -j-  {ix:  +  yx/), 
y  =  iua .  tj  =  w^  =  to  a,  a  =  w,j  =  wy  =  to  a  =  a. 

The  last  three  equations  can  be  consistently  satisfied  for  every  value 
of  a.     We  may  take  a  —  1 ;  and  therefore 

is  a  function  of  the  required  type. 

This  result  is  confirmed  by  actual  calculation.     We  find 


08  THEORY    OF    SUBSTITUTIONS. 


P8  = 


3 

-..-.  i  +  6. <•,•.<•;.)•;--  —  (.<■,-.<•/  +  .'V'-<V  +  •«■/'.«■;  +  ...) 


_ 

If  /■  =  1  the  result  becomes  simpler,  in  that  the  last  parenthesis 
becomes  equal  to 

s/  j  =  0»i— a*)  fa— xt)  (■«'i— •<•;); 

whereas,  in  general,  this  parenthesis  is  only  a  rational  function  of 
\/  J .     If  we  write,  as  usual, 

we  have,  for  r  =  1, 


c;  =  I  j 2c,3— 9c,c2  +  27 c3  ±  3  V  —  3  A\. 

Suppose  now  that  n  =  4. 

It  is  obvious  that  a  function  of  the  type  axf  -\-  ftx{  -\-yx{  -\-  8x{, 
in  which  every  term  contains  only  one  element,  cannot  satisfy  the 
condition  of  being  multiplied  by  to  when  operated  on  by  a  =  (.r,x,^3). 

We  enquire  then  whether  the  required  function  can  be  of  the 
type 

<P\  —  aXirX2r  -\-  ,-'7-<V  +  /'■'';'  Xir  +  a?/(aja;ir  +  PiXf  +  YiX-/), 
where  every  term  contains  two  of  the  four  elements.     If  this  type 
should  also  fail  to  satisfy  the  requirements  we  should  have  to  pro- 
ceed to  more  complicated  forms.     We  shall,  however,  obtain  a  posi- 
tive result  in  the  present  case,  and  in  fact  we  may  take  r  =  1,  so  that 

From  the  condition  y>a=toy>i,  we  have  the  series  of  equations 


CDjJ  =    U) 


!      3 

y  —  uj  a  =  a , 


yx  =  oia, ,  /9,  =  ury1  —  ura1 }    a,  =  u){ix  =  ory^  =  aj8a,  =  a, . 

All  of  these  equations  are  satisfied  independently  of  the  values  of  a 
and  «n  and  we  have 

But  again,  the  substitution  r  =  (x^x^)  converts  cr,  into  crT,  where 
cT  is  equal  to  the  product  of  ft  by  some  cube  root  of  unity,  since 


MULTIPLE-VALUED    FUNCTIONS ALGEBRAIC    BELATION8.  01) 

V,1  =  (fT\  Whether  this  cube  root  is  1,  a,  or  w2  cannot  be  deter- 
mined beforehand.     We  find 

<fT  —  «.*Vr4  +  'V""'-''rri  +  avx\.v..  -f-  Xs{wax2  +  ofa.x\  -f-  0*0,0;, ), 

and  since  the  terms  of  e,  and  $rT  which  contain  o;,^  are 

'/pivr,  and  ajw2^:,^  . 

the  cube  root  of  unity  by  which  c^  is  multiplied  must  therefore  be 
w2.  From  the  equation  cT  =  o/V,  it  follows,  by  comparison  of  coef- 
ficients that 

a  =  ai r(w rflj)  =  o»a, ,      «:  =  ar«. 

These  two  equations  are  consistent,  since  «:!  =  1.  Putting  a  =  1,  and 
arranging  according  to  the  powers  of  a>,  we  have  then 

The  function  c{  is  therefore  a  combination  of  the  three  values  of 
a  function  which  we  have  already  discussed.     The  group  of  <r,  is 

Cr —  (_-Lj     v^'r-^j)  (**'3^'4/j     v'V':;)  \"^*2*^4/j     v'V'l'  (•'.•^  ;)J- 

That  cr,:!  is  two-valued  is  also  readily  shown,  if  we  write 

/y*  'V»       I      v»  ->-»    —  11         -■>-»  y    _J fy*  /vi    —  /i/         /y*  'y*    I—  /y*  /y*    —  ■?/ 

For  then  cr,  coincides  with  the  expression  obtained  above  for  the 
case  n  =  3 ;  and  since  yx ,  y, ,  ys ,  are  the  roots  of  the  equation 

//  —  <'..'//"  +  (CiC-s—lCt)  y—(crci  —  ±c,ei  +  c;)  =  0, 

where  the  c's  are  the  coefficients  of  the  equation  of  which  the  roots 
xx,  x.2,  x3,  xi,  (§  54),  we  can  translate  the  expression  obtained  for 
n  =  3  directly  into  a  two-valued  function  of  the  four  elements 
xt ,  Xo,  x3,  xt,  since  we  have  (§  54)  J„  —  J  . 


CHAPTER   IV 


TRANSITIVITY    AND   PRIMITIVITY.      SIMPLE  AND  COMPOUND 

GROUPS.     ISOMORPHISM. 

£  60.     The  two  familiar  functions 

'     1 '      '      I      iA/Q.iJUa  a  tX.it/. i  tA  ■>*/,  I 

differ  from  each  other  in  the  important  particular  that  the  group 
belonging  to  the  former 

(rv*    /vt    /v»    /y»     \        /    (i      .»     v»      v.     V    I 
.(     ].«     ;:.(     ._,.<      j    /,         (    .1      [.(      ,.(     _..(     ;.    )      | 

contains  substitutions  which  replace  .r,  by  .<_,,  oj3,  or  r, ,  while  in  the 
group  belonging  to  the  latter 

G-j  =  |_1,  (■'']•'.')>    ('*':!-*-4)5    (•i*i-*'L,)  (■-l':i<Ci)] 

there  is  no  substitution  present  which  replaces  a;,  by  xa  or  .r4.  The 
general  principle  of  which  this  is  a  particular  instance  is  the  basis 
of  an  important  classification.  We  designate  a  group  as  transit irr, 
if  its  substitutions  permit  us  to  replace  any  selected  element  .r,  by 
every  other  element.  Otherwise  the  group  is  intransitive.  Thus  G, 
above,  is  transitive,  while  Gx  is  intransitive. 

It  follows  directly  from  this  definition  that  the  substitutions  of 
a  transitive  group  permit  of  replacing  every  element  .«-,  by  every 
element  xk.  For  a  transitive  group  contains  some  substitution 
8  =  (.<-,.''.  ...)...  which  replaces  .r,  by  .r,,  and  also  some  substitu- 
tion t  =  {XyXk  ...)...  which  replaces  ,r,  by  xk.  Consequently  the 
product  s    'f,  which  also  occurs  in  the  group,  replaces  x{  by  xk. 

The  same  designations,  transitive  and  intransitive,  are  applied  to 
functions  as  to  their  corresponding  groups. 

It  appears  at  once  that  the  elements  of  an  intransitive  group 
are  distributed  in  systems  of  transitively  connected  elements.  For 
example,  in  the  group  G',  above  .r,  and  x2,  and  again,  xt  and  .r,,  are 
transitively  connected.  Suppose  that  in  a  given  intransitive  group 
there  are  contained  substitutions  which  connect  xlt  .<■_,,  .  .  .  xa  transi- 


GENERAL    CLASSIFICATION    OF   GROUPS.  71 

tively,  others  which  connect  xa+i1  asa+a>  •  •  •  xa+b>  an(i  s0  on,  but 
none  which,  for  instance,  replace  .»',  by  xa+\  (A ^  1),  and  so  on.  The 
maximum  possible  number  of  substitutions  within  the  several  sys- 
tems is  a!,  6!,  ... ,  and  consequently  the  maximum  number  in  the 
given  group,  if  a,  (>,...  are  known,  is  a!  bl  .  .  .  If  only  the  sum 
a  -\-  b  -\-  ...=  >t  is  known,  the  maximum  number  of  substitutions  in 
an  intransitive  group  of  degree  n  is  determined  by  the  following 
equations : 

(n— 1)1  l!  =  ^=i(n  —  2)!  2!  >(n  —  2)!  2!,     (n >  3) 
(n— 2)!  2!=-^=^(w— 3)!3!  >  (n— 3)!  3!,     («>5). 

o 
Theorem  I.     The  maximum  orders  of  intransitive  groups 

of  degree  n  are 

(w— 1)!,  i(n— 1)!,  (to— 2)!2!,(w— 2)!,  (n  —  3)!3!,  (w— 3)!2!,  .  .  . 

The  first  two  orders  here  given  correspond  to  the  symmetric  and 
the  alternating  groups  of  (n  —  1)  elements,  so  that  in  these  cases  one 
element  is  unaffected.  The  third  corresponds  to  the  combination 
of  the  symmetric  group  of  (n  —  2)  elements  with  that  of  the  re- 
maining two  elements.  The  fourth  belongs  either  to  the  combina- 
tion  of  the  alternating  group  of  (n  —  2)  with  the  symmetric  group 
of  the  remaining  two,  or  to  the  symmetric  group  of  (n  —  2)  ele- 
ments alone,  the  other  two  elements  remaining  unchanged;  and  so 
on. 

The  construction  of  intransitive  from  transitive  groups  will  be 
treated  later,  ( §  99). 

§  61.  We  proceed  now  to  arrange  the  substitutions  of  a  transi- 
tive group  in  a  table.  The  first  line  of  the  table  is  to  contain  all 
those  substitutions 

S1  :=  1 ,  S> ,  S3  ,  .  .  .  Sm 

which  leave  the  element  xx  unchanged,  each  substitution  occurring 
only  once.  From  the  definition  of  transitivity,  there  is  in  the  given 
group  a  substitution  e2  which  replaces  .r,  by  .<■_,.  For  the  second  line 
of  the  table  we  take 

"21  S2ff2j  N)'7J>  •  •  •  8mff2. 


,'1  THEORY    OF    SUBSTITUTIONS. 

We  show  then,  1)  that  all  the  substitutions  of  this  line  replace  .r,  by 
for  every  .sA  leaves  sc,  unchanged  and  <ra  converts  ,r,  into  .«'..;  2) 
that  all  the  substitutions  which  produce  this  effect  are  contained  in 
this  line;  for  if  r  replaces  /r,  by  .*•._.,  ~*2~l  leaves  a?,  unchanged  and  is 
therefore  contained  among  the  sA's;  but  from  r«ra ~1  =  8\  it  follows 
that  r  =  sA<ra;  3)  that  all  the  substitutions  of  the  line  are  distinct; 
for  if  $aT.,  =  .s^^j,  we  obtain  by  right  hand  multiplication  by  tr2  ', 
«a  =  -^;  4)  that  the  substitutions  of  the  second  line  are  all  different 
from  those  of  the  first;  for  the  latter  leave  .*',  unchanged,  while  the 
former  do  not. 

We  select  now  any  substitution  <rg  which  converts  ,r,  into  .v.  and 
form  for  the  third  line  of  the  table 


The  substitutions  of  this  line  may  then  be  shown  to  possess  proper- 
ties similar  to  those  of  the  second.  We  continue  in  this  way  until 
all  the  substitutions  of  the  group  are  arranged  in  n  lines  of  m  sub- 
stitutions each.     We  have  then 

Theorem  IT.  //  the  number  of  substitutions  of  a  transi- 
tive group,  which  leave  any  element. r,  unchanged,  is  m,  the  order  r 
of  the  group  is  mn,  i.  e.,  always  a  multiple  of  n. 

The  following  extension  of  this  theorem  is  readily  obtained: 

Corollary.  If  xa,  xh,xc,  . .  .  are  any  arbitrary  elements  of 
the  group  G,  and  if  m  is  the  order  of  the  subgroup  of  G  which 
dors  not  affect  these  elements,  then  the  order  of  G  ismn',  where  n'  is 
the  number  of  distinct  systems  of  elements  xa,  Xp,  xy,  .  .  .  by  which 
the  substitutions  of  G  can  replace  x„,  xh,  xc,  .  .  . 

£  62.  A  group  is  said  to  be  k-fold  transitive  when  its  substitu- 
tions permit  of  replacing  k  given  elements  by  any  k  arbitrary  ones. 
It  can  be  readily  shown  that  any  k  arbitrary  elements  can  then  be 
replaced  by  any  A:  others.  The  definition  includes  the  case  where 
any  number  of  the  k  elements  remain  unchanged.  A  A--fold  transi- 
tive group  must  contain  one  or  more  substitutions  involving  any 
arbitrarily  chosen  cycle  of  the  kih  or  any  lower  order.  Thus  in  a 
four- fold  transitive  group  there  must  be  substitutions  which  leave 
cr,  and  x2  unchanged  but  interchange  .r:;  and  .r4,  and  which  are  there- 


GENERAL    CLASSIFICATION    OF    GROUPS.  73 

fore  of  the  form  (xt)  (x2)  (a*3a-4) .  .  .  The  same  group  must  also 
contain  a  substitution  which  leaves  £Cl5  x2,  xs,  xi  all  unchanged;  this 
may  of  course  be  the  identical  substitution. 

For  an  example  of  a  three-fold  transitive  group  we  may  take  the 
alternating  group  of  5  elements.  If,  for  instance,  we  require  a  sub- 
stitution which  leaves  x2  unchanged  and  replaces  ,rx  and  xs  by  xs  and 
x3  respectively,  the  circular  substitution  S  =  (x^x^)  satisfies  these 
conditions,  and,  being  equivalent  to  the  two  transpositions  (.:«•  ,.*■-)  ( .i\x3), 
belongs  to  the  alternating  group.  This  same  alternating  group  can- 
not however,  be  four-fold  transitive,  for  it  must  then  contain  a  sub- 
stitution which  converts  xu  x2,  x3,  x4  into  xl9  x2,  x3,  xr>  respectively; 
this  could  only  be  the  transposition  (xix5),  and  this  cannot  occur  in 
the  alternating  group. 

In  general,  we  can  show  that  the  alternating  group  of  n  ele- 
ments is  always  (n — 2)- fold  transitive.  The  requirement  that  any 
(n — 2)  elements  shall  be  replaced  by  (n — 2)  others  may  take  any 
one  of  three  forms.  In  the  first  place  it  may  be  required  that 
(n  —  2)  given  elements  shall  be  replaced  by  the  same  elements  in  a 
different  order,  so  that  two  elements  are  not  involved.  Secondly, 
the  requirement  may  involve  (n  —  1)  elements,  or,  thirdly,  all  the  n 
elements. 

In  the  first  case  suppose  that  a  is  a  substitution  which  satisfies 
the  conditions,  and  let  r  be  ih.e  transposition  of  the  two  remaining 
elements.  Then  vr  also  satisfies  the  conditions,  and  one  of  the  two 
substitutions  t,  i~  belongs  to  the  alternating  group. 

If  (n  —  1)  elements  are  involved,  suppose  that  the  remaining 
element  is  x„ ,  so  that  neither  the  element  which  replaces  xn  nor  that 
which  x„  replaces  is  assigned.  The  elements  which  are  to  replace 
Xi ,  a?2  ,...&„_]  are  all  known  with  the  exception  of  one.  Suppose 
that  it  is  not  known  which  element  replaces  xn_x.  Then  from  the 
elements  .r, ,  ,<•._,,  .  .  ,  <£„_,  we  can  construct  one  substitution  which 
satisfies  the  requirements,  say  a  —  ( .  . .  xa  x„  _x  xb  ....)...  ,  and  from 
the  n  elements  a  second  one,  only  distinguished  from  the  first  in  the 
fact  that  ;r„_,  is  followed  by  x„,  thus  -  =  (....*•„.<•„,.<•.(„...) 
=  t  .  (xbx„).     Then  either  <>  or  -  belongs  to  the  alternating  group. 

Finally,  if  all  the  n  elements  are  involved,  there  are  two  elements 
for  which  the  substituted  elements  are  not  assigned.     Suppose  these 


1 4  THEORY    ui'    SUBSTITUTIONS. 

to  be  .*•„_,  and  .<■„.  If  now  the  elements  are  arranged  in  cycles  in 
the  usual  manner,  there  will  be  two  cycles  which  are  not  closed,  the 
one  ending  with  xn  _ , ,  the  other  with  x„ .  We  can  then  construct 
two  substitutions  a  and  r  which  satisfy  the  requirements,  the  one 
being  obtained  by  simply  closing  the  two  incomplete  cycles,  the  other 
by  uniting  the  latter  in  a  single  parenthesis.  From  Chapter  II, 
Theorem  XI,  it  then  follows  that  either  t  or  -  belongs  to  the  alterna- 
ting  group. 

The  alternating  group  of  n  elements  is  therefore  at  least  (n  —  2)- 
fold  transitive.  It  cannot  be  (n  —  l)-fold  transitive,  since  it  contains 
no  substitution  which  leaves  x1,x2,  .  .  .  r„__,  unchanged,  and  con- 
verts A'„_l  into  .r„. 

§  63.  If  G  is  a  /.-fold  transitive  group,  the  subgroup  G'  of  G 
which  does  not  affect  .>',  will  be  (k — l)-fold  transitive;  the  subgroup 
G"  of  G'  which  does  not  affect  x2  will  be  (k — 2)-fold  transitive, 
and  so  on.  Finally  the  subgroup  G(k~l>  which  does  not  affect 
x\,  a?2,  .  .  .  £Ci_]  will  be  simply  transitive.  Applying  Theorem  II 
successively  to  G'A_1),  .  .  .  G",  G',  G,  we  obtain 

Theorem  III.  The  order  r  of  a  k-folcl  transitive  group  is 
equal  to  n(n  —1)  (n  —  2)  .  .  .  (n  —  k-\-l)m,  where  m  is  the  order  of 
a  a n  subgroup  which  leaves  k  elements  unchanged. 

$  64.  A  simply  transitive  group  is  called  non-primitive  when 
its  elements  can  be  divided  into  systems,  each  including  the  same 
number,  such  that  every  substitution  of  the  group  replaces  all  the 
elements  of  any  system  either  by  the  elements  of  the  same  system 
or  by  those  of  another  system.  The  substitutions  of  the  group  can 
therefore  be  effected  by  first  interchanging  the  several  systems  as 
units,  and  then  interchanging  the  elements  within  each  separate  sys- 
tem. 

A  simply  transitive  group  which  does  not  possess  this  property 
is  called  primitive. 

For  example,  the  groups 

UT]  —  [_1,  (•l'l.l':)J    (./',.<•,),    \XvX.i)  (,'''/''|)i    '•']•'':)  (•'V*'4/>    Kp^V^i)  Kp^i^i/i 
\X\Xyl'  s'  \>i  '  ■'']■'  :'_■';'  |5 
'     —   )  A,  \XiX.2%i)i  (•'']■''    '•    I  •'    •'    •'    I?   \XiXyT,,-!'  _..(',  ''T''  .''yC^j  f 


GENERAL    CLASSIFICATION    OF    GROUPS.  75 

are  both  non-primitive.     Gx  has  two  systems  of  elements,  xx ,  <«■_,  and 

The  powers  of  a  circular  substitution  of  prime  order  form  a 
primitive  group,  e.  g.  Gr3  =  [l,  (.r, .*•_,.<•,),  (.r,.r..r,(  |. 

The  powers  of  a  circular  substitution  of  composite  order 
form  a  non-primitive  group.  If  the  degree  of  the  substitution  is 
11  =Piai  ■  i>>a2  ■  lhai  ■  •  • ,  where  pu  p.,,  p3,  .  .  .  are  the  different  prime 
factors  of  u,  the  corresponding  systems  of  elements  can  be  selected 
in  [('/,  +  1)  (a2  +  1)  {'L.i  +  1)  •  •  •  — 2 J  different  ways,  as  is  readily  seen. 
For  example,  in  the  case  of  the  group 

UTj  —  |^1,  (•'V'_"'':;'''e''.y''i./»   ( ■'V';''".)  ( ''VY'f'j    (•'V'»'  (•'_:•'':,)  '  ■';•'■  )< 

we  may  take  either  two  systems  of  three  elements  each,  xl ,  x2 ,  x5  and 

■"'■2i  -''4»  •*'.,?  or  three  systems  of  two  elements  each,  .r,,a'4,  x2,  xTj, 
and  .»■,,  x6. 

A  theorem  applies  here,  the  proof  which  may  be  omitted  on 
account  of  its  obvious  character: 

Theorem  IV.  If,  for  a  non-primitive  group,  the  division 
of  the  elements  into  systems  is  possible  in  two  different  ways  such 
that  one  division  is  not  merely  a  subdivision  of  the  other,  then  a 
third  mode  of  division  can  also  be  obtained  by  combining  into  a 
new  system  the  elements  common  to  a  system  of  the  first  division 
and  one  of  the  second. 

It  must  be  observed  that  a  single  element  is  not  to  be  regarded 
as  a  "system"  in  the  present  sense.  Thus  the  group  Gt  above 
admits  of  only  two  kinds  of  systems. 

>}  65.  The  elements  of  a  non-primitive  group  G  can  be  ar- 
ranged in  a  table,  as  follows.     The  first  line  contains  all  and  only 

those  substitutions 

•S]  =  I,  s.,,  s3,  .  .  .  sm 

which  leave  the  several  systems  unchanged  as  units,  and  which 
accordingly  only  interchange  the  elements  within  the  systems.  (The 
line  will  of  course  vary  with  the  particular  distribution  of  the  ele- 
ments in  systems.) 

From  the  definition  of  transitivity,  (for  the  names  "primitive" 
and  "non-primitive"  apply  only  to  simply  transitive  groups),  there 


76  THEORY    01    SUBSTITUTIONS. 

must  be  in  the  given  group  a  substitution  <r3  which  converts  any  ele- 
ment .<•„  of  one  system  into  an  element  .»•,,  of  another  system,  and 
which  consequently  interchanges  the  several  systems  in  a  certain 
way.     For  the  second  line  of  the  table  we  take 

ff2>   S2ff2)    S8ff2j   •   •   •  S,.^l- 

We  show  then,  1 )  that  all  the  substitutions  of  this  line  produce  the 
same  rearrangement  of  the  order  of  the  systems  as  <r2;  for  every  S\ 
leaves  this  order  unchanged;  2)  that  all  substitutions  which  produce 
the  same  rearrangement  of  the  systems  as  <r2  are  contained  in  this 
line;  for  if  r  is  one  of  these,  then  ~(t.,~x  =  sA,  so  that  r  =  8\<r2)  '4) 
that  all  the  substitutions  of  the  second  line  are  different  from  one 
another;  and  4)  that  they  are  all  different  from  those  of  the  first 
line. 

If  there  is  then  still  another  substitution  a%  which  produces  a 
new  arrangement  of  the  systems,  this  gives  rise  to  a  third  line  which 
possesses  similar  properties,  and  so  on. 

Theorem  V.  If  a  non-primitive  group  G  contain*  a  sub- 
group 6r,  of  order  m  ivhich  does  not  interchange  the  several  systems 
of  elements,  the  order  r  of  G  is  equal  to  mq,  where  q  is  a  divisor  of 
fil,  fi  being  the  number  of  systems. 

§  66.  If  we  denote  the  several  systems,  regarded,  so  to  speak, 
as  being  themselves  elements,  by  A, ,  A., ,  .  .  .  AM ,  then  all  the  substi  - 
tutions  of  any  one  line  of  the  table  above,  and  only  these,  produce 
the  same  rearrangement  of  the  A,,  A,,  .  .  .  AM.  To  every  line  of  the 
table  corresponds  therefore  a  substitution  of  the  A's,  the  first  line, 
for  example,  corresponding  to  the  identical  substitution,  etc.  These 
new  substitutions  we  denote  by  5,  —  1,  §2,  ...  §g.  It  is  readily  seen 
that  they  form  a  new  group  ©.  For  the  successive  application  of 
50  and  i$  to  the  elements  A  produces  the  same  rearrangement  of 
these  elements  as  if  the  corresponding  <ra  and  t^  were  successively 
applied  to  the  elements  x.  Accordingly,  since  <rati^=.ny,  we  have 
also  §a§/s  =  §7 ,  where  §y  corresponds  to  the  line  of  the  table  above 
which  contains  vy.  The  system  of  §'s  therefore  possesses  the  char- 
acteristic property  of  a  group. 

We  perceive  here  a  peculiar  relation  between  the  two  groups  G 
and  (s).     To  every  substitution  8  of  the  former  corresponds  one  sub- 


GENERAL    CLASSIFICATION    OF    GROUPS.  77 

stitution  5  of  the  latter,  and  again  to  every  5  of  (^j  corresponds  either 
one  substitution,  or  a  certain  constant  number  of  substitutions  s  of  G. 
And  this  correspondence  is  moreover  of  such  a  nature  that  to  the 
product  of  any  two  .s-'s  corresponds  the  product  of  the  two  corres- 
ponding §'s. 

If  to  every  3  there  corresponds  only  one  s,  then  there  is  only  one 
substitution,  identity,  in  (5  which  leaves  the  order  of  the  systems  A 
unchanged.  The  two  following  groups  may  serve  as  an  example  of 
this  type.     Suppose  that 

Cr  =  ^1,  (,r,.r, )  (.r.j^)  (.<'-,.*'0j,  [X^X^  (X2X6)  (^X^v^),  (XyVr<'ti)  (.<■_,.('-'    \. 

'  ■' 'i«*Y)  v*V*Y'  v*Y*V'*   v"l**V*J  '"'  W'-vJ- 

Here  the  systems  A13  A,,  and  A3  are  composed  respectively  of  x{ 

and  .<•_,,  .r.  and  .»',..,  and  xt  and  x^.  The  corresponding  substitutions 
of  the  ^-i's  form  the  group 

©  =  [1,  (A2A3),  (A,A2),  {AlAtAt)i  {AXA3\  (A.A.A,^. 

§  67.     We  examine  more  closely  the  subgroup 

Ctj  =  j_Sj ,  So ,  S3 ,  .  .  .  Sm J 

of  the  group  G  of  §  65.  Since  Gx  cannot  replace  any  element  of 
one  system  by  an  element  of  another  system,  it  follows  that  Gt  is 
intransitive.  Any  arbitrary  substitution  t  of  G  transforms  G1  into 
1  Gr,  t  =  G\ .  The  latter  is  also  a  subgroup  of  G;  it  is  similar  to  Gx ; 
and  it  evidently  does  not  interchange  the  systems  of  G.  It  follows 
that  G\  =  6?j . 

Suppose  that  any  system  of  a  non-primitive  group  consists  of  the 
elements  x\ ,  x'2 ,  x'3 , .  .  .  The  subgroup  Gl  therefore  permutes  the 
elements  x'  among  themselves.  We  proceed  to  examine  whether 
these  elements  are  transitively  connected  with  one  another  by  the 
group  Gx ,  or  whether  this  is  the  case  only  when  substitutions  of  G 
are  added  which  interchange  the  systems  of  elements.  Suppose 
that  x\,x'.2,  .  .  .  x'a,  and  again  x'a  +  1,  .  .  .  x'8,  etc.,  are  transitively 
connected  by  Gr, .  Then  G  contains  a  substitution  of  the  form 
t  =  (x']x'a  +  1  ...)...,  and  since  t~lGlt  =  Gl,  it  follows  that  t  re- 
places all  the  elements  x\,  x'2,  . .  .  x'a  by  x'a  +  l .  .  .  x'$.  Further 
consideration  then  shows  that  x\ ,  x'2 ,  .  .  .  x'a  form  a  system  of  non- 
primitivity. 


78  THEORY    OF    SUBSTITUTIONS. 

Accordingly  if  the  systems  of  non-primitivity  are  chosen  at  the 
outset  as  small  as  possible,  then  the  group  G,  connects  all  the  ele- 
ments of  every  system  transitively. 

Assuming  the  systems  to  be  thus  chosen,  we  direct  our  attention 
to  those  cycles  of  the  several  substitutions  of  Cr,  which  interchange 
the  elements  x\,  x'.,,  .  .  .  of  any  one  system  of  non-primitivity. 
These  form  a  transitive  group  H'.  Similarly  the  components  of  the 
several  substitutions  of  Gx  which  interchange  the  elements  .r,(a),  a^). . . 
of  any  second  system  form  a  group  Ha>.  The  groups  H',  H",  .  .  . 
are  similar,  for  if  t  =  (x'lxlia}.  .  .).  .  .  is  a  substitution  of  G,  then 
the  transformation  t~1Glt=  G{  will  convert  H'  into  Ha\     The  order 

of  H'  is  a  multiple  of  --  and  a  divisor  of  — !,  where  ,"  is  the  number 

of  systems  of  non-primitivity. 

§  68.  The  following  easily  demonstrated  theorems  in  regard  to 
to  primitive  and  non-  primitive  groups  may  be  added  here: 

Theorem  VI.  If  from  the  element*  .»-,,  ,»•_,,  .  .  .  x„  of  a  tran- 
sitive group  G  any  system  x\,  x'.,,  .  .  .  can  be  selected  such  that 
every  substitution  of  G  which  replaces  anyx'aby  an  x1 p  permutes 
tin    xns  only  among  themselves,  then  G  is  a  non-primitive  group. 

Theorem  VII.     If    from    the  elements   xt,x2 c„    of    a 

transitive,  group  G  tivo  systems  .<■',,  .*•'_,,  .  .  .  and  .<•",,  x".,,  .  .  .  can  be 
selected  such  that  any  substitution  which  replaces  any  element  ■<■'„ 
by  an  xH p  replaces  all  the  xf,s  by  .*•'"*,  then  G  is  a  non  primitive 
(/ roup. 

Theorem  VIII.  Every  primitive  group  Q  contains  substi- 
tutions which  replace  an  element  x'aof  any  given  system  .*■',,  x'.,,  .  .  . 
by  <ni  element  of  the  same  system,  and  which  at  tin  same  timereplace 
any  second  element  of  the  system  by  some  element  not  belonging  to 

the  system.  * 

§  09.  The  preceding  discussion  has  led  us  to  two  general  prop- 
erties of  groups  which,  together  with  transitivity  and  primitivity, 
are  of  fundamental  importance. 

In  §  07  the  subgroup  Gx  of  G  possessed  the  property  of  being 
reproduced  by  transformation  with  respect  to  every  substitution  t  of 

*  Radio:  Ueber  primitive  Gruppen.    Crelle  CI.  p.  i. 


GENERAL    CLASSIFICATION    OF    GROUPS.  79 

G,  so  that  for  every  t  we  have  t  lG{t  =  Gt.  We  may  conveniently 
indicate  this  property  of  Gr,  by  the  equation 

G~1GlG=Gl    or    G1G=GG1. 

It  is  to  be  observed  however  that  this  notation  must  be  cautiously 
employed.  For  example,  if  Gx  is  any  subgroup  of  G,  we  have 
always  Gx~lGGx  =  G,  and  from  this  equation  would  apparently  fol- 
low GGX  =  GXG,  and  consequently  Gx  =  G'1  GxG.  But  this  last 
equation  holds  only  for  a  special  type  of  subgroup  Gx .  The  reason 
for  this  apparent  inconsistency  lies  in  the  fact,  that  in  the  equation 
G~l  Gx  G  =  Gx  the  two  6r's  represent  the  same  substitution  and  the 
two  GVS  m  general  different  substitutions,  while  in  the  equation 
Gx~*  GGi  =  G  the  reverse  is  the  case. 

We  introduce  here  the  following  definitions. 

1)       Two  substitutions  s{  and  s.,  are  commutative  *  if 

"2)     A  substitution  sx  and  a  group  H  are  commutative  ij 

s.H^Hs,. 
3)     Two  groups  H  and  G  are  commutative  if 

HG=GH. 

The  last  equation  is  to  be  understood  as  indicating  that  the  product 

of  any  substitution  of  H  into  any  substitution  of  G  is  equal  to  the 

product  of  some  substitution  of  G  into  some  substitution  of  H,  so 

that,  if  the  substitutions  of  G  are  denoted  by  s  and  those  of  H  by  /. 

then 

$Jp  =  t7s$ 
for  every  a  and  B. 

Under  2)  sx  may  be  a  substitution  of  H\  for  sx  and  H  are  then 
always  commutative.  Under  3)  a  case  of  special  importance  is  that, 
an  instance  of  which  we  have  just  considered,  for  which  H  is  a  sub- 
group of  G.  In  this  case  sa  and  s$  of  the  equation  sjp  =  tyS&  are 
always  to  be  taken  equal. 

A  subgroup  H  of  any  group  G.  for  which  G  lHG  —  H,  is  called 
a  self -conjugate  subgroup  of  G. 

•German:  "vertausctabar";  French:  "^changeable",  retained  as  "interchangeable  ;' 
by -Bolza:  Artier.  Jour.  Math.  XIII,  p.  11. 


S(  •  THEORY    OF    SUBSTITUTIONS. 

The  following  may  serve  as  examples: 

1 1     The  substitutions  s,  =  (.**,.<•,.(•,)  (.»•,.'■-,.«■,,),  s,  =  (.r,;r4) (x2x,J  (x 
are  commutative;  for  their  product  is  (.<,1.r.vt,:J.r4.r2a,,;),  independently 
of  the  order  of  the  factors. 

Every  power  sa  of  any  substitution  s  is  commutative  with  every 
other  power  ,s8  of  the  same  substitution. 

Two  substitutions  which  have  no  common  element  are  commuta- 
tive. 

2)  The  group  H=il,(.cl.r)(.rrri),(x1x3)(x.,xi),(x1xi)(x^)]iB 
commutative  with  every  substitution  of  the  four  elements  xl,x2i 

■  r>- 
The  alternating  group  of  n  elements  is  commutative  with  every 
substitution  of  the  same  elements. 

3)  The  group  if  of  2),  being  commutative  with  the  symmetric 
group  of  the  four  elements  xn  x2,  x:i,  xt,  is  a  self-conjugate  sub- 
group of  the  latter. 

The  alternating  group  of  n  elements  is  a  self-conjugate  sub- 
group of  the  corresponding  symmetric  group. 

Every  group  G  of  order  r,  which  is  not  contained  in  the  alterna- 
ting group  A,  contains  as  a  self- conjugate  subgroup  the  group  H  of 
order  £r  composed  of  those  substitutions  of  G  which  are  contained 
in  A  (Theorem  VIII,  Chapter  II). 

The  identical  substitution  is,  by  itself,  a  self-conjugate  sub- 
group of  every  group. 

J>  7< ).  We  may  employ  the  principle  of  commutativity  to  further 
the  solution  of  the  problem  of  the  construction  of  groups  begun  in 
Chapter  II  (§§  33-40). 

All  substitutions  of  n  elements  which  are  commutative  with  any 
given  substitution  of  the  same  elements,  form  a  group. 

For  if  fj ,  t2 . . .  are  commutative  with  s,  it  follows  from 

that 

so  that  the  product  txt2  also  occurs  among  the  substitutions  t. 

All  substitutions  of  n  elements  which  are  commutative  with  a 


GENERAL    CLASSIFICATION    OF    GROUPS.  81 

given  group  G  of  the  same  elements  form  a  group  which  contains  G 
as  a  self -conjugate  subgroup. 

For  from 

£i —  G  t  j  =  G,     1 2 —  Gt-2=  G, 
follows 

(tit2)~lG(tlQ  =  G; 

and  among  the  V s  are  included  all  the  substitutions  of  G. 

If  two  commutative  groups  G  and  H  have  no  substitution,  er^ept 

the  identical  substitution,  in  common,  then  the  order  of  the  smallest 

group 

K-  \G,H\ 

is  equal  to  the  product  of  the  orders  of  G  and  H. 

§  71.     If  a  group  G  of  order  2r  contains  a  subgroup  H  of 
of  order  r,  then  H  is  a  self-conjugate  subgroup  of  G. 

For  if  the  substitutions  of  H  are  denoted  by  1,  s.,,  s3,  . .  .  sr,  and 
if  t  is  any  substitution  of  G  which  is  not  contained  in  H,  then 
t,  ts.2,  ts3,  .  .  .  ts,.  are  the  remaining  r  substitutions  of  G.  But  in  the 
same  way,  t,  s.,t,  s3t, .  .  .  s,.t  are  also  these  remaining  substitutions. 
Consequently  every  substitution  sat  is  equal  to  some  tsp,  that  is,  wr 
have  in  every  case  t~18pt=  sa,  and  therefore  G~lHG  =  H. 

If  a  group  G  contains  a  self-conjugate  subgroup  H  and  any 

other  subgroup  K,  then  the  greatest  subgroup  L  common  to  H  and 

K  is  a  self-conjugate  subgroup  of  K.     If  the  orders  of  G,  H,  K,  L 

ci  1c 

are  respectively  g,  h,  k,  I,  then  —  is  a  multiple  of  — . 

iv  V 

For  if  s  is  any  substitution  of  K,  then  s~xLs  is  contained  in  K, 
since  all  the  separate  factors  s  ~ l,  L,  s  are  contained  in  K.  But 
s~lLs  is  also  contained  in  H,  for  L  is  a  subgroup  of  H  and 
s~lHs  =  H.  Consequently  s~1Ls  is  contained  in  L,  and,  as  these 
two  groups  have  the  same  number  of  substitutions,  we  must  have 
s~xLs  =  L,  and  L  is  a  self- conjugate  subgroup  of  K. 

The  relation  between  the  orders  of  the  four  groups  follows  at 
once  from  the  formula  of  Frobenius  (§  48).  We  have  only  to  take 
for  the  K  of  this  formula  the  present  group  H,  and  to  put  all  the 

di ,  d,,  .  .  .  d„,  equal  to  I.    We  have  then  fr  =  ~r • 

hk        I 

6 


82  THEORY    OF    SUBSTITUTIONS. 

.1  self-conjugate  subgroup  of  a  transitive  group  either  affects 
every  element  of  the  latter,  or  els<  it  consists  of  the  identical  substi- 
tution alone. 

For  if  H  =  G~lHG  is  a  self- conjugate  subgroup  of  the  transi- 
tive group  G,  and  if  H  does  not  affect  the  element  .r, ,  then,  since  G 
contains  a  substitution  S\  which  replaces  .<■,  by  .rA,  it  would  follow 
that  .sA_1iJsA  =  ff  would  also  not  affect  X\,  that  is,  that  //would 
not  affect  any  element. 

If  a  self -con  jugate  subgroup  of  a  transitive  group  G  is  intransi- 
tive, then  G  is  non -primitive  and  H  only  interchanges  the  elements 
within  the  several  systems  of  non-primitivity. 

For  suppose  that  xl  and  .rA  belong  to  two  different  systems  of 
intransitivity  with  respect  to  H.  Then  G  contains  a  substitution  sK 
which  replaces  x\  by  ;rA,  and  since  sA  ]Hs>,  =  H,  it  follows  that 
S\~}HsK  must  replace  .rx  only  by  elements  transitively  connected 
with  X\  with  respect  to  H.  But  .sA  '  replaces  a*A  by  a?,  and  H  re- 
places ,Ti  by  every  element  of  the  same  system  of  intransitivity  with 
'-, .  Consequently  the  remaining  factor  sA  must  replace  every  ele- 
ment of  the  system  containing  .r,  by  an  element  of  the  system  con- 
taining .rA.  The  systems  of  intransitivity  of  H  are  therefore  the 
systems  of  non-primitivity  of  G. 

§  72.  Another  important  property  is  that  of  the  correspond- 
ence of  two  groups,  of  which  an  instance  has  already  been  met 
with  in  §  06.  The  two  groups  G  and  &  of  this  Section  were  so 
related  that  to  every  substitution  s  of  G  corresponded  one  substitu- 
tion §  of  &,  and  to  every  3  corresponded  a  certain  number  of  s's. 
The  correspondence  was  moreover  such  that  to  the  product  of  any 
two  .s's  corresponded  the  product  of  two  corresponding  §'s. 

We  may  consider  at  once  the  more  general  type  of  correspond- 
ence, *  where  to  every  substitution  of  either  group  correspond  a 
certain  number  of  substitutions  of  the  other,  and  to  every  pro- 
duct 8a8p  corresponds  every  product  «a^  of  corresponding  S's  and 
vice  versa.  We  may  then  readily  show  that  to  every  substitution  of 
the  one  group  correspond  the  same  number  of  substitutions  of  the 
other.     For  if  to  1  of  the  group  G  correspond  1,  §2,  §8,  .  .  .  §,  of  ©, 

*  A.Capelli:  Battagliul  Glor.  1878,  p. 32 aeq. 


GENERAL    CLASSIFICATION    01    GROUPS.  83 

then,  if  3  corresponds  to  8,  all  the  substitutions  §,  §§2,  <J33,  .  .  .  §§9 
correspond  to  8,  by  definition.  Conversely,  if  any  substitution  §' 
corresponds  to  s,  then  »  '  §'  corresponds  tos-1s==l,  and  therefore 
8  '»'  is  contained  in  the  series  1,  §2,  §3, . . .  §3.  Consequently  the 
series  §,  §§3,  g§8,  .  .  .  §§g  contains  all  the  substitutions  of  03  which  cor- 
respond to  s,  and  the  number  q  is  constant  for  every  s.  Similarly 
to  every  §  correspond  the  same  number  p  of  the  substitutions  s. 

It  is  evident  at  once  that 

the  substitutions  of  G'(W)  which  con-expand  to  the  identical  substi- 
tution of  &  (G)  form  a  group  H  (%>)  which  is  a  self -conjugate  sub- 
group of  G  (©). 

The  correspondence  of  two  groups  as  just  defined  is  called  iso- 
morphism. If  to  every  substitution  of  G  correspond  q  substitutions 
of  ©,  and  to  every  substitution  of  0)  p  substitutions  of  G,  then  G 
and  ©  are  said  to  be  (p-q)-fold  isomorphic,  or  if  p  and  q  are  not 
specified,  manifold  isomorphic.  If  p  =  q  =  1,  the  groups  are  said 
to  be  simply  isomorphic.  * 

Examples. 

I.  The  groups 

G  =  [1,  (.r.-r,)  (x3xb)  (xtX5),  (xvv,)  (.r„r,)  (.*',.»•,,),  (.c^,)  (x2Xb)  {x3X5), 

r=[l5(c^2),   (~3),  (?2|3),   (^8j,   (*,*,*,)] 

are  simply  isomorphic,  the  substitutions  corresponding  in  the  order 
as  written.  For  if  any  two  substitutions  of  G,  and  the  corres- 
ponding substitutions  of  l\  are  multiplied  together,  the  resulting 
products  again  occupy  the  same  positions  in  their  respective  groups. 

II.  The  groups 

G  =  [1,  (.rvr,)l        /'=[!,  (4^2)  (£&),  (*,*)  (5^,;,  (f.fj  (**8)] 

are  (1 -2)-fold  isomorphic.  Corresponding  to  1  of  G  we  may  take, 
beside  1,  any  other  arbitrary  substitution  of  /'.  It  follows  that  /'  is 
simply  isomorphic  with  itself  in  different  ways. 

*<y.  Camille  Jordan :  Trait6 etc.,  §  G7-74,  whore  the  names  " boloedric "  and  •ineri- 
edric"  isomorphism  are  employed  These  liavo  been  retained  by  Rolza:  Amer.Jour, 
Vol.  XIII.  The  "simply,  manifold,  (p-g)-fold  isomorphic  "  above  represent  the  "em- 
stufig,  nielirstuiig,  (p-g)-stufig  Isomorpb  "  of  the  German  edition. 


84  THEORY    OF    SUBSTITUTIONS. 

III.     The  groups 

G  =  [1,  (a^)  faxd,  (oJiJCg)  (avr4),  (x,a-4)  (x.,x.,)], 
r=  [lj  ('i "2^3)5  (^1^2)*  ('1^2)5  (m^))j  ('jr ..» I 
are  (2-3)-fold  isomorphic.     To  the  substitution  1  of  G  correspond 
1,  (£i£a£s)>  (^1^3)    of    A    an(i    conversely   to    1    of    /'    correspond 
1,  (iCiiCa)  (x^)    Of    G. 

§  73.  If  G  and  F  are  (m-n)-fold  isomorphic,  then  their  orders 
are  in  the  ratio  of  m :  n. 

If  L  is  a  self-conjugate  subgroup  of  G,  and  if  A  is  the  corres- 
ponding subgroup  of  I,  then  A  is  a  self-conjugate  subgroup  of  I. 

For  from  G~1LG  =  L  follows  at  once  r~lA  r=  A.  In  the  case 
of  (p-l)-fold  isomorphism,  it  may  however  happen  that  the  group 
A  consists  of  the  identical  substitution  alone. 

§  74.  Having  now  discussed  the  more  elementary  properties  of 
groups  in  reference  to  transitivity,  primitivity,  commutativity,  and 
isomorphism,  we  turn  next  to  certain  more  elaborate  investigations 
devoted  to  the  same  subjects. 

The  m  substitutions  of  a  transitive  group  G  which  do  not  affect 
the  element  xx  form  a  subgroup  Gx  of  G.  Similarly  the  substitutions 
of  G  which  do  not  affect  x.,  from  a  second  subgroup  G2,  and  so  on 
to  the  subgroup  G„  which  does  not  affect  x„.  All  those  subgroups 
are  similar;  for  if  <ra  is  any  substitution  of  G  which  replaces  .r,  by 
xa,  we  have  ^a~101Ta=  G2.  The  groups  Ga  are  therefore  all  of 
order  m. 

If  now  we  denote  by  [g]  the  number  of  those  substitutions  of  (m\ 
which  affect  exactly  q  elements  but  leave  the  remaining  (n  —  q — 1) 
unchanged,  then  [g]  is  also  the  corresponding  number  for  each 
of  the  other  groups  G2,  G3,  . .  .  G„.  It  follows  then  from  the  mean- 
ing of  the  symbol  \<[\  that 

m=[n— 1]  +  |>_2]+  .  . .+[«]+  . . .  +[2]  +  [0], 

where  the  symbol  [1]  does  not  of  course  occur,  and  [0]  =  1. 
Gl,G.2,...G„  therefore  possess  together  n\n  —  1]  substitutions 
which  affect  exactly  {n — 1)  elements.  These  are  all  different,  for 
any  substitution  which  leaves  only  .ra  unchanged  occurs  in  Ga,  but 
cannot  also  occur  in  Gp.     But  this  is  not  the  case  with  substitutions 


GENERAL    CLASSIFICATION    OF    GROUPS. 


85 


which  affect  exactly  (n  —  2)  elements ;  for  if  any  one  of  these  leaves 
both  xa  and  x$  unchanged,  it  will  occur  in  both  Ga  and  Gp .  Accord- 
ingly every  one  of  these  n\ii  —  2]  substitutions  is  counted  twice, 
and  G  therefore  contains  £  n\n  —  2]  substitutions  which  affect 
exactly  (n —  2)  elements.  Similarly  every  one  of  the  n\if\  substitu- 
tions of  q  elements  which  occur  in  Gx ,  G2 ,  .  .  .  Gn  is  counted  (n  —  q) 

times,  and  there  are  therefore  only  [q]  different  substitutions 

in  G  which  affect  exactly  q  elements.  We  have  then  for  the  total 
number  of  substitutions  in  G,  which  affect  less  than  n  elements 

»[„_l]+|[„_2]+...+-i-M+...+^[0]. 

If  this  number  is  subtracted  from  that  of  all  the  substitutions  in  G, 
the  remainder  gives  the  number  of  substitutions  in  G  which  affect 
exactly  n  elements.     But  from  Theorem  II 

r  =  ran  =  n[n  —  1]  -f-  n[ii — 2]  -(-...+  n\_q~\  +  .  .  .  +  w[0]> 

and  consequently  the  required  difference  N  is 

.(|[»-2]  +  ?-[»-8]  +  - . .  +.-==E=lw  +  •  ■  ■  +^[0]> 

No  term  in  the  parenthesis  is  negative.     The  last  one  is  equal  to 

n—1  since  [0]  =  1.     Consequently  N  >  (n— 1). 
n 

Tlieorem  IX.  Every  transitive  gromp  contains  at  least 
(n  —  1)  substitutions  which  affect  all  the  n  elements.  If  there  are 
more  than  (n  —  1)  of  these,  then  the  group  also  contains  substitu- 
tions which  affect  less  than  (u  —  1)  elements.* 

Corollary.  A  k-fold  transitive  group  contains  substitutions 
which  affect  exactly  n  elements,  and  others  which  affect  exactly 
(n — 1),  (n  —  2),  .  .  .  (n  —  fc+1)  elements. 

Those  substitutions  which  affect  exactly  k  elements  we  shall  call 
substitutions  of  the  kth  class.  We  have  just  demonstrated  the 
existence  of  substitutions  of  the  nth ,  or  highest  class. 

If  we  consider  a  non- primitive  group  G,  there  is  (§  66)  a  second 
group  ©  isomorphic  with  G,  the  substitutions  of  which  interchange 

*C.  Jordan:  Liouville  Jour.  (2),  XVII,  p  351. 


SI)  THEORY    OF    SUBSTITUTIONS. 

the  elements  .A,,  A.,,  .  .  .  A„  exactly  as  the  corresponding  substitu- 
tions of  G  interchange  the  several  systems  of  non-primitivity. 
Since  67  is  transitive,  03  is  also  transitive.  From  Theorem  IX  fol- 
lows therefore 

Theorem  X.  Every  nou-pri)>iitive  group  G  contains  substi- 
tutions which  interchange  all  the  systems  of  non-primitivity. 

§  75.  We  construct  within  the  transitive  group  G  the  subgroup 
H  of  lowest  order,  which  contains  all  the  substitutions  of  the  high- 
est class  in  G,  and  prove  that  this  group  H  is  also  transitive. 

H  is  evidently  a  self-conjugate  subgroup  of  G.  If  H  were 
intransitive,  G  must  then  be  non- primitive  (Theorem  VI).  If  this 
is  the  case,  let  0)  be  the  group  of  §  06  which  affects  the  systems 
A},  A2,  . .  .  A^  regarded  as  elements.  03  is  transitive.  To  substitu- 
tions of  the  highest  class  in  03  correspond  substitutions  of  the  high- 
est class  in  G.  (The  converse  is  not  necessarily  true).  Suppose  that 
£)  is  the  subgroup  of  the  lowest  order  which  contains  all  the  substi- 
tutions of  the  highest  class  in  ©.  To  .£)  then  corresponds  eithor  H  or 
a  subgroup  of  H.  If  ,£)  is  transitive  in  the  A's,  H  is  transitive  in  the 
x'b.  The  question  therefore  reduces  to  the  consideration  of  the 
groups  03  and  ^).  £)  can  be  intransitive  only  if  ©  is  non- primitive 
and  G  accordingly  contains  more  comprehensive  systems  of  non- 
primitivity.  If  this  were  the  case,  we  should  again  start  out  in  the 
same  way  from  ©  and  ,£),  and  continue  until  we  arrive  at  a  primitive 
group.     The  proof  is  then  complete. 

Theorem  XI.  In  every  transitive  group  the  substitutions  of 
the  highest  class  form  by  themselves  a  transitive  system. 

§  70.  Suppose  a  second  transitive  group  G'  to  have  all  its  sub- 
stitutions of  the  highest  class  in  common  with  G  of  the  preceding 
Section.  If  then  we  construct  the  subgroup  H'  for  G',  correspond- 
ing to  the  subgroup  If  of  Of  we  have  H'  =  H. 

Moreover  the  number  IV,  of  the  substitutions  of  the  highest  class 
in  H  is 

where  ( <j  |,  has  the  same  relation  to  H  as  [</]  to  G.  But  the  number 
iVj  is,  as  we  have  just  seen  equal  to  the  N  of  §  74.     Consequently 


GENERAL    CLASSIFICATION    OF    GROUPS. 


87 


// 


Ji([n— 2]-[n  — 2],)  +  §([n— 8]— [*-«D+... 

...+^=i(M-[3]1)+..-^o. 

Bat,  since  H  is  entirely  contained  in  G,  it  follows  that  [g]  2l[g]i, 
and  therefore  the  left  hand  member  of  the  equation  above  can  only 
vanish  if  each  parenthesis  is  0.  Consequently  G  and  G'  can  only 
differ  in  respect  to  substitutions  of  the  (n —  l)th  class. 

Theorem  XII.  If  hvo  transitive  groups  have  all  their  sub- 
stitutions of  the  highest  class  in  common,  they  can  only  differ  in 
those  substitutions  which  leave  only  one  element  unchanged. 

§  77.  Let  G  be  any  transitive  group  and  GnG2,  . . .  G„  those 
subgroups  of  G  which  do  not  affect  xu  x2, . . .  xn  respectively. 
These  groups  are,  as  we  have  seen,  all  similar.  If  now  Gx ,  and  con- 
sequently G-2,  .  .  .  Gtl,  are  fc-fold  transitive,  then  G  is  at  least  (k-\- 1)- 
fold  transitive.  For  if  it  be  required  that  the  (k  -f  1)  elements 
xx,x2,  .  .  ,xk  +  l  shall  be  replaced  by  xhi  xh, . . ,  x,%+i  respectively,  we 
can  find  in  G  some  substitution  s  which  replaces  xx,x2,xz,  . .  .xk.  +  l 
by  xh,xhi,xll3,.  .  .x,,k.  +  l,  where  xh„,x,,3,...  may  be  any  elements 
whatever.  Again  67,-,  contains  some  substitution  t  which  replaces 
•''/,.,.  •**/,.),  ..  .  by  x^Xig, ...  "Consequently  the  substitution  st  of 
G  satisfies  the  requirement. 

From  this  follows  the  more  general 

Theorem  XIII.  //  a  group  G  is  at  least  k-fold  transi- 
tive, and  if  the  subgroup  of  G  which  leaves  k  given  elements  un- 
changed is  still  h-fold  transitive,  then  G  is  at  least  (k-\-li)-fold  tran- 
sitive* 

§  78.  Suppose  that  those  substitutions  of  a  A;- fold  transitive 
group  G,  which,  excluding  the  identical  substitution,  affect  the 
smallest  number  of  elements,  are  of  the  qth  class,  i.  e.,  that  they 
affect  exactly  q  elements.  The  question  arises  whether  there  is  any 
connection  between  the  numbers  A;  and  q. 

In  the  first  place  suppose  k^q,  and  let  one  of  the  substitu- 
tions of  the  qth  class  contained  in  G  be  s  =  (xvr2 ...)...(...  x,t  ,  xq). 
Then,  on  account  of  its  fc-fold  transitivity,  G  also  contains  a  substitu- 

*G.  Frobenius:  Ueberdie  Congruenz  nach  einem  aus  zwei  endlichen  Gruppen  geb- 
ildeten  Doppelniodul.    Crelle  CI.  p.  290. 


88  THEORY    OP    SUBSTITUTIONS. 

tion  rt-,  which  replaces  .r, ,  x., , . . .  xtJ  _ , ,  .r7  by  .r, ,  x., , . . .  o?g_1 ,  a1,  (*  >  r/), 
;uul  which  is  therefore  of  the  form 

a  —  (a\)  (.?,)  . .  .  (.r7_ ,)  («„««  . .  .)• 
We  have  then 

(*-  V)s_I  =  [(ajjJBj, ...)...(...  a^as.)]*-1  =  (&s_-i8«Pt)i 
and  since  this  substitution  affects  only  3  elements,  it  follows  that 

Secondly,  suppose  k<q.  The  substitutions  of  the  5th  class  may 
then  be  of  either  of  the  forms 

S,    =   \pC1X.2   ...)..    ,\.    .    .   Xff  —  \  Of/,.   ...  )  ...(..    .  Xq)y 

s2  =  (av»2 ...)...(...  ./>_,)  (x,, ...)...(..  .xq). 
In  the  first  case  we  take 

ffj  =  (a;,) (ajjj) . .  .  (^_i) («**«  .  . . )     (A;  +  1)  <  x  <  g, 
and  in  the  second 

*2  =  0»i)  (#2)  •  •  •  (a»i-i)  (a?»*A  • . .  •)     ^  >  g- 
It    is  evident    that   both   are    possible,   if  in  the  latter  case  it  is 
remembered  that  n  >  q.     We  obtain  then 

(r2_1sa<r2  =  (ajjiBa ...)...(...  a7A._ ,)  (a*A  ... ), 

and  if  we  form  now  (ffj-  18ta{)8{~ \  the  first  (/c  —  2)  elements  are 
removed,  and  there  remain,  at  the  most,  q~\~(q — k) —  (k  —  2) 
=  2q  —  2k  +  2.  Similarly,  if  we  form  (<r2~  ^.^s.r  ',  the  first  (k  -\-  1) 
elements  are  removed,  and  thero  remain,  at  the  most,  q  -\-  (q —  k-\- 1) 
-{k — 1)  =  2q  —  2k -\- 2.  By  hypothesis,  this  number  cannot  be 
less  than  q.     Consequently 

q>2k  —  2. 

Theorem  XIV.     If  a  k-fold  transitive  group  contains  any 
substitution,    except  the   identical   substitution,  which    affects    less 
than  (2k — 2)  elements,  it  contains  also  substitutions  which  affectxxt  y^ 
the  most  onlij  three  elements. 

This  theorem  gives  a  positive  result  only  if  k  >  2.  In  this  case, 
by  anticipating  the  conclusions  of  the  next  Section,  we  can  add  the 
following 


(IKNKKAL     CLASSIFICATION     OF    (iKOUPS. 


89 


Corollary.  If  a  k-f old  transitive  group  fc> 2  contains  sub- 
stitutions, different  from  identity,  which  affect  nut  tuore  limn 
(2k —  2)  elements,  it  is  either  the  alternating  or  the  symmetric  group. 

We  may  now  combine  this  result  with  thi  corollary  of  Theorem 
IX.  If  (I  is  fc-fold  transitive,  it  contains  substitutions  of  the  class 
(it — k-\-l).  Accordingly  q^L(n —  k-{-l).  If  G  is  neither  the 
alternating  nor   the  symmetric  group,  q  >  (2k —  2).     Consequently 


M 


( n  —  k  +  1 )  >  ( 21c  —  2)  and  k 


<n+*  V 


y 


Theorem  XV.     If  a  {/roup  of  degree  n  is  neither  the  oiler 

noting  nor  the  symmetric  group,  it  is,  at  the  most,  \~-\-l  t-foldtran- 

si  tire. 

That  the  upper  limit  of  transitivity  here  assigned  may  actually 
occur  is  demonstrated  by  the  five-fold  transitive  group  of  twelve 
elements  discovered  by  Matthieu, 

it  ==  ^  ( ./'.  I'j.i'j.r ; )  [X^X^X^Xi ),  ( XX^X^X^ )  l  ,1'j.r j.r ../  (  ). 

XViX)  (x1X6)(x3X1)  (.VrV:,),  (//,//, )  (x1X3)(xiX7)(x&XG), 

(jhU:) (x:x5) (x3x7)(xix6),  (yty3) (xxx3) (xtx5 )(x&x7)\. 

§  7(J.  Theorem  XVI.  If  ak-fold  transitive  group  (k  >  1 ) 
contains  a  circular  substitution  of  three  elements,  it  contains  the 
alternating  group. 

Suppose  that  s  =  (a;, x2x3)  occurs  in  the  given  group  G.  Then, 
since  G  is  at  least  two-fold  transitive,  it  must  contain  a  substitution 
r,  =  (.r:;)  (.rvcrrA.  ..)...  and  consequently  also 

t  —  a    ls(i  =  ^x3xixp),       r~1sr  =  (a;1Mt). 

In  the  same  way  it  appears  that  G  contains 

Consequently  (§  35)  (/contains  the  alternating  group. 

Theorem  XVII.     If  a  k-fold  transitive  group  (k>  1)  con 
fains  a  transposition,  the  group  is  symmetric. 

The  proof  is  exactly  analogous  to  the  preceding. 
For  simply  transitive  groups  the  last  two  theorems   hold  only 
6a 


90  THEORY    OF    SUBSTITUTIONS. 

under  certain  limitations,  as  appear  from  the  following  instances 

(x2  —  }  -lj  (•^'l^"2'^3/>  v"4«'Vs,/j   \*^7*^8*^9/>  V^l'^5^'a^'^'«*^*7'^'3^4*^8/ )  * 

Both  of  these  are  transitive.  But  the  former  contains  a  substi- 
tution of  two  elements,  without  being  symmetric,  and  the  latter  a 
substitution  of  three  elements  without  being  the  alternating  group. 

§  80.     An  explanation  of  this  exception  in  the  case  of  simply 
transitive  groups  is  obtained  from  the  following  considerations. 

If  we  arbitrarily  select  two  or  more  substitutions  of  n  elements, 
it  is  to  be  regarded  as  extremely  probable  that  the  group  of  lowest 
order  which  contains  these  is  the  symmetric  group,  or  at  least  the 
alternating  group.  In  the  case  of  two  substitutions  the  probability 
in  favor  of  the  symmetric  group  may  be  taken  as  about  f ,  and  in 
favor  of  the  alternating,  but  not  symmetric,  group  as  about  \. 
In  order  that  any  given  substitutions  may  generate  a  group  which 
is  only  a  part  of  the  n !  possible  substitutions,  very  special  relations 
are  necessary,  and  it  is  highly  improbable  that  arbitrarily  chosen 

substitutions  s,  =  I  J  J  )  should  satisfy  these  conditions.  The 

exception  most  likely  to  occur  would  be  that  all  the  given  substitu- 
tions were  severally  equivalent  to  an  even  number  of  transposi- 
tions and  would  consequently  generate  the  alternating  group. 

In  general,  therefore,  we  must  regard  every  transitive  group 
which  is  neither  symmetric  nor  alternating,  and  every  intransitive 
group  which  is  not  made  up  of  symmetric  or  alternating  parts,  as  de- 
cidedly exceptional.  And  we  shall  expect  to  find  in  such  cases 
special  relations  among  the  substitutions  of  the  group,  of  such  a 
nature  as  to  limit  the  number  of  their  distinct  combinations. 

Such  relations  occur  in  the  case  of  the  two  groups  cited  above. 
Both  of  them  belong  to  the  groups  which  we  have  designated  as 
non-primitive.  In  (?,  the  elements  x^ ,  .r_,  form  one  system,  and 
x3,  xt  another;  it  is  therefore  impossible  that  (V,  should  include,  for 
example,  the  transposition  (.r^).  In  G.,  there  are  three  systems  of 
non-primitivity  xliX2iahi  ^r4 ,  .^- ,  it*,; ,  and  «r7,  .r„,  .*•,,,  (!,  therefore 
cannot  contain  the  substitution  {x^x-,). 


GENERAL    CLASSIFICATION    OF    GROUPS. 


91 


It  is,  then,  evidently  of  importance  to  examine  the  influence  of 
primitivity  on  the  character  of  a  transitive  group,  and  we  turn  our 
attention  now  in  this  direction. 

§  81.     With  the  last  two  theorems  belongs  naturally 

Theorem  XVIII.  If  a  primitive  group  contains  either  of 
the  two  substitutions 

it  contains  in  the-fermer  case  the  alternating,  in  the  latter  the  sym- 
metric group. 

The  proofs  in  the  two  cases  are  of  the  same  character.  We  give 
only  that  for  the  latter  case. 

From  Theorem  VIII,  the  given  group  must  contain  a  substitu- 
tion which  leaves  ;*',  unchanged  and  replaces  x.,  by  a  new  element 
x3,  or  which  leaves  x,  unchanged  and  replaces  x1  by  a  new  element 
.*•;, ,  or  which  replaces  xx  by  x2  or  x,2  by  xt  and  the  latter  element  in 
either  case  by  a  new  element  x3.  If  then  we  transform  t  with 
respect  to  this  substitution,  we  obtain  a  transposition  r'  connecting 
either  ac,  or  x,  with  x3 ,  for  example  -'  =  (x^).  The  presence  of  - 
and  t'  in  the  group  shows  that  the  latter  must  contain  the  symmet- 
ric group  of  the  three  elements  a?i,a?2,£c3.  From  Theorem  VIII 
there  must  also  be  in  the  given  group  a  second  substitution  which 
replaces  one  of  these  three  elements  by  either  itself  or  a  second  one 
among  them,  and  which  also  replaces  one  of  them  by  a  new  element 
xt.     Suppose  this  substitution  to  be,  for  instance, 

We  obtain  then 

-"  =  s~l  (x2xz)  s  =  (x^i), 

and  it  follows  that  the  given  group  contains  the  symmetric  group  of 
the  four  elements  xl,  sc2,  x3,  xt\  and  so  on. 

§  82.     We  can  generalize  the  last  theorem  as  follows: 
Theorem  XIX.     If  a  primitive  group  G  with  the  elements 
xy ,  .r_, .  .  .  x„  contains  a  primitive  subgroup  H  of  degree  k  <  n,  then 
G  contains  a  series  of  primitive  subgroups  similar  to  H, 

H\t  Hn  H21  •  ■  ■  H„—i  + 


92  THEORY    OF    SUBSTITUTIONS. 

such    that  every  1IK  affects    the   elements   ■>\,.c zc*-h#*+a-ij 

where  .rM  .«\,  .  .  .  .<•/,_,  may  be  selected  arbitrarily. 

We  take  Hx  =  H  and  transform  H  with  respect  to  all  the  substi- 
tutions of  G  into  i/, ,  H\ ,  H'\ ,  .  . .  Now  let  //',  be  that  one  of  the 
transformed  groups  which  connects  the  k  elements  xlt  x2,  .  . .  .rA  of 
H}  with  other  elements,  but  with  the  smallest  number  of  these. 
We  maintain  that  this  smallest  number  is  one.  For  if  several  new 
elements  r, ,  =■,,  ...  occurred  in  H\,  then  from  Theorem  VIII  there 
must  be  in  the  primitive  group  H\  a  substitution  which  replaces 
one  :  by  another  ?  and  at  the  same  timo  replaces  a  second  ?  by  one 
of  the  elements  x11  x2, . . .  xk.     Suppose  that 

t—  (ftt£/S  •  •   •  SyXS  ...)••• 

is  such  a  substitution,  the  case  where  /?  =  y  being  included.  Then 
H'\  =  tHlt~1  will  still  contain  &y  but  will  not  contain  =a.  //",,  there- 
fore contains  fewer  new  elements  :  than  H\.  Consequently  if  H\ 
is  properly  chosen,  it  will  contain  only  one  new  element,  say  .r,  ,  , 
It  will  therefore  not  contain  some  one  of  the  elements  of  H] ,  say  •'„. 
We  select  then  from  Hx  a  substitution  u  =  (.  .  .  .raxti.  ...)...  and 
form  the  group  u-1  H\u  =  H2.     This  group  contains 

but  not  .*',,.  In  the  same  way  we  can  form  a  group  //.,  which  affects 
only  a?i,  x2 .  .  .  xk_1,  xk+2,  and  so  on. 

It  remains  to  be  shown  that  a?n  x2,  .  .  .  xk  ,  can  bo  taken  arbitra- 
rily, that  is,  that  the  assumption  H  =  //,  is  always  allowable.  Sup- 
pose that  //,  contains  xi , x2 , .  . .  xk_a.  Then  in  the  series  //,,  //_.,... 
there  is  a  group  //„  which  also  contains  //,  a  +  ].  Proceeding  from 
//„  and  the  elements  a;,,  x2,. . .  Xk__a+1,  we  construct  a  series  of 
groups,  as  before,  arriving  finally  at  the  group  II. 

§88.  Theorem  XX.  If  a  primitive  group  0  of  degree  h 
contains  a  primitive  subgroup  H  of  degree  I:  then  G  is  at  least 
(//  —  A; -J-  1  )-fold  transit  ire. 

From  the  preceding  theorem  //,  affects  the  elements  .r, ,  ,r.;,  .  .  .  xt ; 
•//,,//.;  the  elements  .»',,. i\, >; ,  .r,  .  , ;  ;//,,//..//,(  the  ele- 
ments   .<, .  x  .  .  .  .  ■•■  .  .'■    .  ,,  r,       ;    ami  so   on.      All  these  groups  are 


GENERAL    CLASSIFICATION    OF    GROUPS. 


93 


transitive;  consequently,  from  Theorem  XIII,   \HU  H2\   is  two  fold 
transitive,  \HX,H2,  Ht\  three-fold  transitive,  and  finally 

/'=  \Hn  .  .  .  H„_,,  +  1\ 

is  at  least  (n  —  k-\-  l)-fold  transitive.     Therefore  G',  which  includes 
/',  is  also  at  least  (n —  k-\-  l)-fold  transitive.  * 

Corollary  I.  If  a  primitive  group  of  degree  n  contains  a 
circular  substitution  of  the  prime  order  p,  the  group  is  at  least 
(n — p  -\-  l)-fold  transit  ire. 

For  the  powers  of  the  circular  substitution  form  a  group  H  of 
degree  p. 

Corollary  II.     If  a  transitive  group  of  degree  n  contains  a 

2n 
circular  substitution  of  prime  order  p  <  -=-,  then,    if    the  group 

o 

docs  not  contain  the  alternating  group,  it  is  non-primitive. 

From  Theorem  XV,  every  group  which  is  more  than  [  -5-  -f- 1  J- 

fold  transitive  is  either  alternating  or  symmetric.  And  since  the 
presence  of  a  circular  substitution  of  a  prime  order  p  in  a  primitive 
group  would  require  the  latter  to  be  at  least  (n — p-\-  l)-fold  tran- 

sitive,  it  would  follow,  if  p  <  -~-,  that  the  group  would  be  more  than 


(l+i> 


.fold  transitive  and  must  therefore  be  either  alternating  or 

symmetric.     As  these  alternatives  are  excluded,  the  group  must  be 
non- primitive. 

§  84.  In  the  proof  of  Theorem  XIX  the  primitivity  of  the 
group  H  was  only  employed  to  demonstrate  the  presence  of  substi- 
tutions which  contained  two  successions  of  elements  of  a  certain 
kind.  The  presence  of  such  substitutions  would  also  evidently  be 
assured  if  H  were  two-fold  or  many-fold  transitive.  Theorems  XIX 
and  XX  would  therefore  still  be  valid  in  this  case.  The  latter  then 
takes  the  form : 

Theorem  XXI.     If  a  primitive  group  G  of  degree  n  con- 

*  Another  proof  of  this  theorem  is  given  by  Rudio:  Ueber  primitive  Gruppen, 
Crelle  Oil,  p.  l. 


94  THEORY    OF    SUBSTITUTIONS. 

tains  a  h-fohi  transitive  subgroup (&>.2)  of  degree  q,  then  G  is  at 
l<  ast  (a  —  q-\-2)  transitive. 

§  85.  If  the  requirement  that  the  subgroup  H  of  the  preceding 
Section  shall  bo  primitive  or  multiply  transitive  is  not  fulfilled,  the 
the  theory  becomes  at  once  far  more  complicated.  *  We  give  here 
only  a  few  of  the  simpler  results. 

Tlicorom  XXII.  If  a  primitive  group  G  of  degree  n  con- 
tains a  subgroiqj  H  of  degree  k  <  n,  then  G  also  contains  a  subgroup 
whose  degree  is  exactly  n  —  1;  or  in  other  words:  A  transitive  group 
G  of  n  elements,  which  has  no  subgroup  of  exactly  n  —  1  elements, 
I 'nt  has  a  subgroup  of  loiver  degree,  is  non-primitive. 

Suppose  that  the  subgroup  H  of  degree  ).  <  n  affects  the  ele- 

n 
ments  ;r,  ,x.,,...X\.     In  the  first  place  if  X  <  -cy  then  the  group  G, 

on  account  of  its  primitivity,  contains  a  substitution  8,  which  replaces 
one  element  of  xx ,  ,r_, , .  .  .  xK  by  another  element  of  the  same  system 
and  at  the  same  time  replaces  a  second  element  of  xx,  x,,  .  .  .  xK  by 
some  new  element.  Then  H'  =  8{~  1Hsx  contains  beside  some  of  the 
old  elements,  also  certain  new  ones,  so  that  H ,  —  \H,H'\  affects 
more  than  /  elements,  but  less  than   n,  since  H  and  H'  together 

n 
affect  at  the  most  (2  X —  1)  <  n.     If  the  degree  /.,  of  Hx  is  still  <  -jr-, 

n 
we  repeat  the  same  process,  until  /,  is  equal  to  or  greater  than  ~. 

a 

Suppose  that  the  elements  of  the  last  Hx  are  x},  a\,,  .  .  .  .rA.  Then 
the  primitive  group  G  must  again  contain  a  substitution  sa  which 
replaces  two  elements  not  belonging  to  //,  by  two  elements,  one  of 
which  does,  while  the  other  does  not,  belong  to  7/, .  Then  the  group 
H\  =  s^H^s.r1  will  connect  new  elements  with  those  of  Hx;  but, 
from  the  way  in  which  82  was  taken,  one  new  element  is  still  not  con- 
tained in  H\ .     That  some  of  the  old  elements  actually  occur  in  H\ 

follows  from  the  fact  that  /,  >  \  n.  Accordingly  H2  =  \HX ,  H\  \  con- 
tains more  elements  than  Hx  but  less  than  G.  Proceeding  in  this 
way,  we  must  finally  arrive  at  a  group  K  which  contains  exactly 
(n —  1)  elements. 

•C.Jordan:  Lionville  Jour.  (2)XVI.  B.  Marggraf :  Ueber  primitive  Gruppen  mlt 
transitlven Untergruppen geringeren  Grades;  Glessen  Dissertation,  i^iio. 


GENERAL    CLASSIFICATION    OF    GROUPS.  '.)"> 

If  H  is  transitive,  then  H',  and  consequently  HX=\H',  H\,  and 
so  on  to  K,  are  also  transitive.  From  Theorem  XIII,  G  must 
therefore  in  this  case  be  at  least  two-fold  transitive.  We  have 
then  the  following 

Corollary.  //  a  primitive  group  G  contains  a  transitive 
subgroup  of  lower  degree,  then  G  is  at  least  two-foul  transitive. 

§  86.  We  turn  now  to  a  series  of  properties  based  on  the  the- 
ory of  self- conjugate  subgroups. 

Let  H=  [1,  s2,88> •  •  •$»]  be  a  self -conjugate  subgroup  of  a 
group  G  of  order  n  —  km.  The  substitutions  of  G  can  be  arranged 
(§  41)  in  a  table,  the  first  line  of  which  contains  the  substitutions 
of  H. 


s,  =  l 

>      S2j 

S3> 

.  .  .  om , 

a2, 

2     2  5 

Ss<T2, 

•   •   •  Sm  0j  1 

ff3) 

S2'73, 

$3*3, 

•  •  •  Sm(T3, 

**» 

S^Sk, 

S^k, 

■  •  ■  Smffk. 

From  the  definition  of  a  self-conjugate  subgroup  we  have  then 

(Sa^o)  (S^p)  =  S^T^^ff^^^p  =  S^SvTa(Tp  =  SKVa>7p, 

that  is,  the  line  of  the  table  in  which  the  product  (s\Ta)  (s^tp)  occurs 
depends  only  on  <?a  and  *p ,  or  in  other  words,  if  every  substitution 
of  the  uth  line  is  multiplied  into  every  substitution  of  the  ,Jth  line, 
the  resulting  products  all  belong  to  one  and  the  same  line. 

If  we  denote  the  several  lines,  regarded  as  units,  by  zx ,  z., ,  .  .  .  zh. , 
then  the  line  containing  the  product  of  the  substitutions  of  za  into 
those  of  Zp  may  be  denoted  by  zaZp.  This  symbol  has  then  a  defi- 
nite, unambiguous  meaning.  Moreover,  zaZp  cannot  be  equal  to 
zazy  or  to  zyZp.  For  then  we  should  have  from  the  last  paragraph 
<Vp  =  ffaS  or  vaTp  =  ay(7p ,  that  is,  ap  =  ay  or  <ra  =  <ry .  Conse- 
quently 


±     iZ\t         Z'l)  •   -    •  Zi1       •   •   •     I 

\  Zx  Za  ,Z.,Za,  .  .  .  ZjZa  . .  .  J 


denotes  a  substitution  among  the  s's,  and  this  substitution  corres- 
ponds to  all  the  substitutions  s^a  (^  =  1,  2,  . . .  m)  of  the  «th  line 
of  the   table.     The  Vs  therefore  form  a  group   T,  which  is  (1— ra)- 


96  THEORY    OF    SUBSTITUTIONS. 

foli I  isomorphic  with  the  given  group  G.  The  degree  and  order  of 
T  are  equal,  and  both  are  ecpial  to  k  (Of.  §  1)7).  To  the  identical 
substitution  of  T  corresponds  the  self-conjugato  subgroup  H  of  G. 

We  shall  designate  T  as  the  quotient  of  Grandi/,  and  write 
accordingly  T=  G:H. 

%  S7.  A  group  G  which  contains  a  self- conjugate  subgroup  H, 
different  from  identity,  is  called  a  compound  group;  otherwise  G  is 
a  si  hi  pie  group.  If  G  contains  no  other  self-conjugate  subgroup  A' 
which  includes  H,  then  His  a  maximal  self '-coujiu fate  subgroup. 

If  G  is  a  compound  group,  and  if  the  series  of  groups 

6r,   (?),    Go,    ...    G^,   1 

is  so  taken  that  every  G\  is  a  maximal  self- conjugate  subgroup  of 
the  preceding  one,  then  this  series  is  called  the  series  belonging  to 
the  compound  group  G,  or  the  series  of  composition  of  G,  or, 
still  more  briefly,  the  series  of  G. 

If  the  numbers 
r,   i\  =  r : ex ,    r2  =  rx : e2 ,    ...    r^  —  flx_1:efJ_,    r^  +  j  • —  r^:elx^_l  —  1 

are  the  orders  of  the  successive  groups  of  the  series  of  composition 
of  G,  then  e,,  e2,  .  .  .  eM  +  1  are  called  the  factors  of  composition  of 
G\  and  we  have  r  =  ele2e,i .  .  .  eM  +  1. 

If,  in  accordance  with  the  notation  of  §  86,  we  write, 

G:GX  =  rx,     Gx :  G-,  =  I\ ,      ■  ■  ■      GV _  j :  G>  =  / 'M ,     G^ :  1  =  /', 

the  order  and  the  degree  of  every  I'a  is  equal  to  ea  (a  =  1, 2,  — «  +  1 ). 
All  the  groups  /'„  are  simple.  For  1\  is  (l-rtt)-fold  isomorphic 
with  Ga^x,  and  to  the  identical  substitution  in  / '„  corresponds  Ga  in 
Gtt_,.  Consequently,  if  J'a  contains  a  self-conjugate  subgroup  dif- 
ferent from  identity,  then  the  corresponding  self- con  jugate  sub- 
group of  Ga-i  (§  73)  contains  and  is  greater  than  Ga.  The  latter 
would  therefore  not  be  a  maximal  self-conjugate  subgroup  of  (?„_,. 
The  groups  / ',  which  define  the  transition  from  every  Ga  to  the 
following  one  in  the  series  of  composition,  are  called  the  factor 
groups  of   G.  * 

*0.  Holder;  Math.  Ann.  XXXIV,  ]>.  30  II. 


GENERAL    CLASSIFICATION    OF    GROUPS.  97 

§  88.  Given  a  compound  group  G,  it  is  quite  possible  that  the 
corresponding  series  of  composition  is  not  fully  determinate.  It  is 
conceivable  that,  if  a  series  of  composition 

G,  Gi ,  Go ,  .  .  .  Gp. ,  1 

has  been  found  to  exist,  there  may  also  be  a  second  series 

Gr,   G  i ,  Gr  2 ,  .  .  .  G  i, ,  1 

in  which  every  G'  is  contained  as  a  maximal  self-conjugate  subgroup 
in  the  preceding  one.  We  shall  find  however  that,  in  whatever 
way  the  series  of  composition  may  be  chosen,  the  number  of  groups 
G  is  constant,  and  moreover  the  factors  of  composition  are  always 
the  same,  apart  from  their  order  of  succession. 

Suppose  the  substitutions  of  Gx  and  G\  to  be  denoted  by  sa  and 
s'a  respectively.  Let  rx  =  r  :e1  be  the  order  of  Gr, ,  and  r\  =  r  :  e'x 
that  of  Gr',.  The  substitutions  common  to  Cr,  and  G\  form  a  group 
J*  (§44),  the  order  x  of  which  is  a  factor  of  both  i\  and  r\.  We 
write 

r]=xy,     r\  =  xy'. 

The  substitutions  of  T  we  denote  by  <ra.  All  the  substitutions  of  Gr, 
may  then  be  arranged  in  a  table,  the  first  line  of  which  consists  of 
the  substitutions  <ra  of  r.     We  obtain 

""i  =  i)     ff2>     »3>  ■  •  •    ""..;      r, 

•^'7l-     ^i'7:-,    §2ffS»  •  •  •  §2ff*;      M"> 


§yff1,  §yff2,         §yff3,        .     .     .      %y<Tx)  ^j 

where  the  §  belonging  to  any  line  is  any  substitution  of  Gr,  not  con- 
tained in  the  preceding  lines.  The  group  G\  can  be  treated  in  the 
same  way.  We  will  suppose  that  in  this  case,  in  place  of  §,,  §2, . . . , 
we  have  §'13  §'2J  .  .  .  Every  substitution  of  G'  or  Gr",  can,  then,  be 
written  in  the  form 

Again,  the  product 

Sa"^' )}-lSas' p  =  S' a-\s' ft'1  Sas' fj)  =  (Sa~ls' p-^y p 

belongs  to  Gr,.     For,  since  G~lG1G=G],  it  follows  that  s'p-1sa8,l3, 

which  occurs  in  the  second  form  of  the  product,  is  equal  to  sy ,  and 

the  product  itself  is  equal  to  sa~lsy.     But,  from  the  third  form,  this 
7 


98  THEORY    OF    SUBSTITUTIONS. 

same  product  belongs  to  G',  since  G~1G'G=  G' ,  and  therefore 
saT^'p'lsa  =  s'y,  so  that  the  product  is  equal  to  s'ys'p.  Conse- 
quently the  product  belongs  to  the  group  /'  which  is  common  to  6r, 
and  6r', .     Hence 

A)  Sa~  's  V  l8*8'p  =  <ry\      8a8'p  =  8'p8affy ;      8'p8a  =  8as' p  <rs . 

In  particular,  since  the  ff's  belong  to  both  the  s's  and  the  s"s,  we 
obtain 

From  this  it  follows  that  the  substitutions  of  the  form  Sa^'/sS  form 
a  group  ©.  For,  by  repeated  applications  of  the  equation  B),  we 
obtain 

The  group  ©  is  commutative  with  (? ;  for  we  have 

G-\$i*>\«d)G=  G-lSsG  ■  G~i5\^G  =  sas'p  =  *y<r& .  s>t  =  M>«- 

The  group  ®  is  more  extensive  than  Cr,  or  6r';  it  is  contained  in  G; 
consequently,  from  the  assumption  as  to  Gx  and  G' ,  &  must  be 
identical  with  G. 

The  order  of  &  is  equal  to  xy  ■  y'.  For,  if  5a*Vv  =  M'j4*>  it  is 
easily  seen  that  a  =  «,  b '  =  ft,  c  =  y.  Consequently  the  order  of  G 
is  also  xyy',  and  since  we  have 

r  =  ?',e,  =  xyet ,     r  =  r\e\  =  xy'e\ 
it  follows  that 

2/'=e,,     2/  =  e',. 


This  last  result  gives  us  for  the  order  of  l\  x 


r         r,       r 


,1 


1       <  1 


I       1  1  1 

We  can  show,  further,  that  F  is  a  maximal  self- conjugate  subgroup 
of  G\  and  of  G\ ,  and  consequently  occurs  in  one  of  the  series  of 
composition  of  either  of  these  groups.  For  in  the  first  place  1\  as 
a  part  of  G\  ,  is  commutative  with  G,,  and,  as  a  part  of  (?,,  is  com- 
mutative with  G\ ,  so  that  we  have 

GrirG1  =  G\,     G'1}l'G']  =  Gl. 

But  since  the  left  member  of  the  first  equation  belongs  entirely  to 
Gj ,  the  same  is  true  for  the  right  member,  and  a  similar  result  holds 
for  the  second  equation.     Consequently 


GENERAL    CLASSIFICATION    OF    GROUPS.  99 

Gl-1rGl  =  r,    G'rli'G'l  =  r. 

Again  there  is  no  self-conjugate  subgroup  of  G1  intermediate  be- 
tween Gi  and  /'  which  contains  the  latter.  For  if  there  were  such  a 
group  H  with  substitutions  ta,  then  it  would  follow  from  A)  that 

ta~  's'p-  ltas'p  —  ffy,     s'|3~  tas'p  =  ta  ■  t„r  s'pT  tas  p  =  tavy  =  t& , 

that  is,  H  is  also  commutative  with  G\.  And  since  Gx  and  G\ 
together  generate  G,  it  appears  that  H  must  be  commutative  with 
G.  If  now  we  add  to  the  fa's  the  §'2,  §'8, . . . ,  then  the  substitu- 
tions %'atp  form  a  group.  For  since  /'  is  contained  in  H  and  in  Gx, 
we  have  from  A) 

This  group  is  commutative  with  G,  since  this  is  true  of  its  compo- 
nent groups  H  and  (?',.  It  contains  G\,  which  consists  of  the  sub- 
stitutions §'affjs.  It  is  contained  in  G,  which  consists  of  the  substitu- 
tions §'a§j3«ry.  But  this  is  contrary  to  the  assumption  that  G\  is  a 
maximal  self-conjugate  subgroup  of  G.  We  have  therefore  the  fol- 
lowing preliminary  result: 

If  in  two  series  of  composition  of  the  group  G,  the  groups  next 
succeeding  G  are  respectively  Gx  and  G\,  then  in  both  series  ice  may 
take  for  the  group  next  succeeding  Gx  or  G\  one  and  the  same  max- 
imal self -conjugate  subgroup  1\  which  is  composed  of  all  the  substi- 
tutions common  to  Gx  and  G\.  If  ex  and  e\  are  the  factors  of 
composition  belonging  to  Gx  and  G\  respectively,  then  V  has  for  its 
factors  of  composition,  in  the  first  series  e\,  in  the  second  ex. 

§  89.     We  can  now  easily  obtain  the  final  result. 
Let  one  series  of  composition  for  G  be 

1)  G,  Gi,  G2,  G3, . . . , 

r,    ?-!  =  r: e, ,  r,  =  i\ : e2,  r3  =  r,: e3,  .  .  .  , 
and  let  a  second  series  be 

2)  G,  G\,  G'2,  G'3,  .  . . , 

r,    r'l  =  r:e\,   r',-r\:e',,  r\  =  r',  :e\,  .  .  . 

Then  from  the  result  just  obtained,  we  can  construct  two  more 
series  belonging  to  G: 


100  THEORY    OF    SUBSTITUTION-. 

3)  G,  <?,,/',  J,  H,  ...  4)  G,G\,1\J,H,..., 

/'.  i\  =  T  :  6j ,   r_,  —  *"i  •  6  i  j  •.  •  •  j         '')  J'  i  —  T  '• e  1 5  r  _•  — =  >'  i  '■  <'i  •  •  •  5 

and  apply  the  same  proof  for  the  constancy  of  the  factors  of  com- 
position to  the  series  1)  and  3),  and  again  2)  and  4),  as  was  employed 
above  in  the  case  of  the  series  1)  and  2).  The  series  3)  and  4) 
have  obviously  the  same  factors  of  composition. 

The  problem  is  now  reduced,  for  while  the  series  1 )  and  2)  agree 
only  in  their  first  terms,  the  series  1)  and  3),  and  again  2)  and  4), 
agree  to  two  terms  each.  The  proof  can  then  be  carried  another 
step  by  constructing  from  1)  and  2)  as  before  two  new  series,  both 
of  which  now  begin  with  G,  G{ : 

1')         G,G1}G2,  &,$,%..., 

3')  Q,Glt   r,  ©,£>,&..., 

r,    r,,  rr2  =  r1:e'2,  r":i  =  r'2:e2,  .  .  . 

These  series  have  again  the  same  factors  of  composition,  and  1')  and 
1 )  and  again  3')  and  3)  agree  to  three  terms,  and  so  on. 

We  have  then  finally 

Theorem  XXIII.  If  a  compound  group  G  admits  of  two 
different  scries  of  composition^  the  factors  of  composition  in  the  two 
ruses  are  identical,  apart  from  their  order,  and  the  number  of 
groups  in  the  two  series  is  therefore  the  same 

§  90.  From  §  8S  we  deduce  another  result.  Since  G~lTG 
belongs  to  Gu  because  G~lGtG  =  (?,,  and  also  to  G\  because 
(,'  lG\G  =  G\,  it  appears  that  G~1rG,  as  a  common  subgroup  of 
Cr,  and  G\,  must  be  identical  with  /',  so  that  /'is  a  self-conjugate 
subgroup  of  G.  From  §  80  it  follows  that  it  is  possible  to  con- 
struct a  group  Q  of  order  e,e',  which  is  (1 T  )-fold   isomorphic 

exe  | 

with  G,  in  such  a  way  that  the  same  substitution  of  il  corresponds 
to  all  the  substitutions  of  G  which  only  differ  in  a  factor  n.  We  will 
take  now,  to  correspond  to  the  substitutions  1,  §2,  §j, . . .  §/y  of  (?,, 
the  substitutions  ],<»,.(».,  .  .  .  w, -,  of  il,  and,  to  correspond  to  the 
1,  §'z,  *'■,,  .  .  .  »',.,  of  6r'j,  the  substitutions  1,  "/,,  «/,,  .  .  .  <-/, ,  of  Q.  In 
no  case  is  %'a  =  %p%y,  for  the  t's  form  the  common  subgroup  of  Gx 


GENERAL    CLASSIFICATION    OF    GROUPS.  1<>1 

and  G'i .     Consequently  the  w's  are  different  from  the  w'  's.     Both 
classes  of  substitutions  give  rise  to  groups : 

fl,  =  [1,  w2,  a»8,  .  .  .  w,-J,      P-o  =  [1,  w'2,  w'8,  .  .  .  w',.J, 

and,  since  §a§'/3  =  ^V-v^  ^  follows  that  fy  fl^  =  Q\  Qx .  Moreover 
every  s  in  G  is  equal  to  %a&p<ry,  that  is  A  =  i-V-'i . 

We  obtain  Q  therefore,  by  multiplying  every  substitution  of  -f2, 
by  every  one  of  Q\. 

§  91.  We  consider  now  two  successive  groups  of  a  series  of 
composition,  or,  what  is  the  same  thing,  a  group  G  and  one  of  its 
maximal  self- conjugate  subgroups  H.  Suppose  that  s\  is  a  substi- 
tution of  G  which  does  not  occur  in  H,  and  let  s\m  be  the  lowest 
power  of  s'i  which  does  occur  in  H  (m  is  either  the  order  of  s\  or 
a  factor  of  the  order).  If  in  is  a  composite  number  and  equal  to 
pq,  we  put  s\''  =  sn  and  obtain  thus  a  substitution  s,  which  does  not 
occur  in  H,  and  of  which  a  prime  power  sf  is  the  first  to  occur  in  H. 
We  then  transform  sx  with  respect  to  all  the  substitutions  of  G,  and 
obtain  in  this  way  a  series  of  substitutions  s1}  s2,  •  •  •  *\-  No  one  of 
these  can  occur  in  H.  For  if  this  were  the  case  with  sa  —  (T~ls1v, 
then  ffsa<r— *  =  sx ,  being  the  transformed  of  a  substitution  sa  of  H 
with  respect  to  a  substitution  a  ~ '  of  G,  would  also  occur  in  H. 

We  consider  then  the  group 

r=  \h,sx,s,,  ..  ._«*}_. 

This  group  contains  H  and  is  contained  in  G.  If  t  is  any  arbitrary 
substitution  of  G,  we  have 

t~1rt=4-l{H91a8f.  .  .  \t  =  t-1Ht-t-*s*t-t-l8.ft .  .  . 

=  h  s^v  ...=r. 

/'is  therefore  commutative  with  G.  These  three  properties  of  1' 
are  inconsistent  with  the  assumption  that  H  is  a  maximal  self-con- 
jugate subgroup  of  G,  unless  V  and  H  are  identical. 

If  we  remember  further  that  all  substitutions,  as  sx,s2,  .  .  .  S\, 
which  are  obtained  from  one  another  by  transformation,  are  similar, 
we  have 

Theorem  XXIV.  Every  group  of  the  series  of  composition 
of  any  group  G,  is  obtainable  from  the  next  following  (or,  every 
group  is  obtainable  from  any  one  of  its  maximal  self -conjugate 


.    TdVERSITY  05    "xI.iFOMflU* 
iSTA  BARBARA  COLLEGE  \ABMA«* 


102  THEORY    OF    SUBSTITUTIONS. 

subgroups)  by  the  addition  of  a  series  of  substitutions,  1)  which  are 

similar  to  one  another,  and  2)  a  prime  power  of  which  belongs  to 
tin  smaller  group.  The  last  actual  group  of  a  series  of  composi- 
tion consists  entirely  of  similar  substitutions  of  prime  order. 

$  \)2.  The  following  theorem  is  of  great  importance  for  the 
theory  of  equations: 

Theorem  XXV.  The  series  of  composition  of  the  symmet- 
ric group  of  n  elements,  consists,  if  n  >  4,  of  the  alternating  group 
and  the  identical  substitution.  The  corresponding  factors  of  com- 
position are  therefore  2  and  hn\  The  alternating  group  of  more 
than  four  elements  is  simple. 

We  have  already  seen  that  the  alternating  group  is  a  maximal 
self-conjugate  subgroup  of  the  symmetric  group.  It  only  remains 
to  be  shown  that,  for  n  >  4,  the  alternating  group  is  simple.  The 
proof  is  perfectly  analogous  to  that  of  §  52,  and  the  theorem  there 
obtained,  when  expressed  in  the  nomenclature  of  the  present  Chap- 
ter, becomes:  a  group  which  is  commutative  with  the  symmetric 
group  is,  for  n  >  4,  either  the  alternating  group  or  the  identical  sub- 
stitution. It  will  be  necessary  therefore  to  give  only  a  brief  sketch 
of  the  proof. 

Suppose  that  Hx  is  a  maximal  self -con  jugate  subgroup  of  the 
alternating  group  H,  and  consider  the  substitutions  of  Hx  which  affect 
the  smallest  number  of  elements.  All  the  cycles  of  any  one  of  these 
substitutions  must  contain  the  same  number  of  elements  (§  52). 
The  substitutions  cannot  contain  more  than  three  elements  in  any 
cycle.     For  if  H  contains  the  substitution 

S  —  (J)CiX.^)C'iXi  ...}..., 

and  if  we  transform  s  with  respect  to  <r=  (.r.cr,),  which  of  course 
occurs  in  H,  then  s~l<r~l8<t  contains  fewer  elements  than  s. 

Again  the  substitutions  of  Hl  with  the  least  number  of  the  ele- 
ments cannot  contain  more  than  one  cycle.     For  if  either 

occurs  in  H,  and  if  we  transform  with  respect  to  a  =  (xxx,x,),  the 
products 

will  contain  fewer  elements  than  sa ,  8$  respectively. 


GENERAL  CLASSIFICATION  OF  GROUPS.  103 

The  substitutions  which  affect  the  smallest  number  of  elements 
are  therefore  of  one  or  the  other  of  the  forms 

8a  =  (XaPp),      t  —  (xaX^Xy)  . 

The  first  case  is  impossible,  since  the  alternating  group  cannot  con- 
tain a  transformation.  The  second  case  leads  to  the  alternating 
group  itself. 

If  n  =  4,  we  obtain  the  following  series  of  composition:  1)  the 
symmetric  group;  2)  the  alternating  group;  3)  6r2  =  [l,  (x^)  ('',), 
(ojja;8)  (xox,),  (X&)  (x..x<)~];  3)  G3  =  [1,  Oi^_>)  (a^)];  5)  ^  =  L  The 
exceptional  group  G2  is  already  familiar  to  us. 

§  93.     We  may  add  here  the  following  theorems: 

Theorem  XXYI.  Every  group  G,  which  is  not  contained 
in  the  alternating  group  is  compound.  One  of  its  factors  of  com- 
position is  2.      The  corresponding  factor  group  is    [(1 ,  z] ,  z,,  )]. 

The  proof  is  based  on  §  35,  Theorem  VIII.  The  substitutions 
of  G  which  belong  to  the  alternating  group  form  the  first  self-con- 
jugate subgroup  of   G. 

Theorem  XXVII.  If  a  group  G  is  of  order  pa,  p  being  a 
prime  number,  the  factors  of  composition  of  G  are  all  equal  top. 

The  group  K  of  order  pf  obtained  in  §  30  is  obviously,  from  the 
method  of  its  construction,  compound.  It  contains  a  self- conjugate 
subgroup  L  of  order  pf~l  and  this  again  contains  a  self- conjugate 
subgroup  .1/  of  order  pf~" ~,  and  so  on.  The  series  of  composition 
of  K  consists  therefore  of  the  groups 

K,     L,     M,     .  .  .   Q,    R,   . .  .  o,  1, 
of  orders 

Pr\pf~\Pf~\  ■  ■  ■Pk,Pk'~\  •  •  -P,  1- 
The  last  corollary  of  §  49  shows  that  we  need  prove  the  present  theo- 
rem only  for  the  subgroups  of  K.  If  G  occurs  among  these  and  is 
one  of  the  series  above,  the  proof  is  already  complete.  If  G  does 
not  occur  in  this  series,  suppose  that  R  is  the  first  group  of  the 
series  which  does  not  contain  G,  while  G  is  a  subgroup  of  Q.     We 

■ 

apply  then  to  G  the  second  proposition  of  §  71.  Suppose  that  H  is 
the  common  subgroup  of  R  and  G.  Then  if  is  a  self- conjugate 
subgroup  of  G,  and  its  order  is  a  multiple  of  pa~l  and  is  conse- 


10  1  THEORY    OF    SUBSTITUTIONS. 

quently  either  p°_I  or  pa.  The  latter  case  is  impossible  since  then 
G  would  be  contained  in  E.  Consequently  H  is  of  order  pa  ~ ',  and 
the  theorem  is  proved. 

Theorem  XXVIII.     If  a  grows   G  of  order  r  contains   a 

v 
self -conjugate  subgroup   H  of  order  —  then  no  substitution  of  G, 

e 

which  does  not  occur  in  H  can  be  of  an  order  prime  to  e.  * 

We  construct  the  factor  group  F  =  G :  H  of  the  order  e.  No  one 
of  the  substitutions  of  /',  except  the  identical  substitution,  is  of  an 
order  prime  to  e.  To  any  substitution  s  of  G  which  does  not  occur 
in  H  corresponds  a  a  which  is  different  from  1.  On  account  of  the 
isomorphism  of  G  and  r,  there  corresponds  to  every  power  s*  of  s 
the  same  power  <r*  of  a.  If  /.  is  the  lowest  power  of  s  for  which 
sK  =  1,  then  at  the  same  time  <rK  =  1.  /.  is  to  therefore  a  multiple  of 
the  order  of  a  and  consequently  is  not  prime  to  e. 

If,  in  particular,  e  is  a  prime  number,  then  the  order  of  every 
substitution  of  G  which  is  not  contained  in  H  is  divisible  by  e. 

§  94.  Among  the  various  series  of  composition  of  a  group  G, 
the  principal  series  of  composition,  or  briefly,  the  principal  series, 
is  of  special  importance  in  the  algebraic  solution  of  equations.  This 
principal  series  is  obtained  from  any  series  of  composition  by  re- 
taining only  those  groups  of  the  series  which  are  themselves  self- 
conjugate  subgroups  of  G.     Suppose  the  resulting  series  to  be 

G,  H,J,  ...  K,  L,  M,  1. 

The  series  of  G  may  itself  be  the  principal  series.  This  will  be 
the  case,  for  example,  as  we  shall  immediately  show,  if  all  the  fac- 
tors of  composition  of  the  series  are  prime  numbers. 

Assuming  that  the  principal  series  is  not  identical  with  the  given 
series,  suppose  that  the  latter  contains,  for  instance  between  H  and 
J,  other  groups,  as 

Hx  is  therefore  commutative  with  H,  but  not  with  G.     Consequently 
H~  HlH  =  H ] ,     G  ~  H}  G  =!=  Hl . 

*A.  Kneser:  Ueber  die  algebraischr  Unauflosbarkeit  bdherer  Gleiclningen.  Crelle 
CVL,  pp.  59-60. 


GENERAL    CLASSIFICATION    OF    GROUPS. 


105 


Accordingly,  if  we  transform  Hx  with  respect  to  all  the  substitutions 
of  G,  we  shall  obtain  a  series  of  groups  HX,H'X,H"X,  .  .  .  All  of 
these  are  contained  as  self- conjugate  subgroups  in  H,  for  if  a  is  any 
substitution  of  G,  then  <r-lH1<r  =  H\  is  contained  in  n-xH<^  —  H. 
Moreover 

H-lH\H  =  H-1(<T-lH1<r)H=(<7-lH-l<7)(<T-lHi>T)(<T-lH«) 

=  <r-1(H-1H1H)<r  =  <r-1H1<r  =  H'1; 

for  if  t  is  any  substitution  of  H,  then  from  ff-1r<T  =  v  follows 
ff-1r-V  =  v-1(c/.§36). 

Again  J  is  contained  in  every  one  of  the  groups  Hl,H\,H'\,... 
For  J  is  contained  in  Hx,  and  consequently  <r~lJf  —  J  is  contained 
in  <t~ lHx<r  —  H\ ,  and  so  on.  Finally  H\ ,  like  Hx ,  is  a  maximal  self- 
conjugate  subgroup  of  H.  For  if  there  were  any  self- conjugate  sub- 
group between  H  and  H\,  then  the  same  would  be  true  of  H  and 
Hu  In  fact  if  H\  is  obtained  from  Hx  by  transformation  with 
respect  to  a,  then  the  intermediate  group  between  H  and  Hx  would 
proceed  from  that  between  H  and  H\,  by  transformation  with 
respect  to  a—1.  In  the  series  of  G,  the  group  H  may  therefore  be 
any  one  of  the  several  groups  of  the  same  type  H1,H\,  .  .  .  All 
of  these  belong  to  the  same  factor  £  of  composition,  t  being  the 
quotient  of  the  orders  of  H  and  Hx .  In  accordance  with  the  pre- 
liminary result  of  §  88,  we  can  then  continue  the  series  of  G  by 
taking  for  the  group  next  succeeding  Hx  the  substitutions  common 
to  Hx  and  H'x,  or  to  Hx  and  H"u  or  to  Hx  and  H'"u  and  so  on. 
From  the  same  result  the  new  groups  all  belong  to  the  same  factor 
of  composition  e.  Every  one  of  them  contains  J.  We  need  of 
course  consider  only  the  different  groups  among  them.  If  there  is 
only  one,  this  must  coincide  with  J.     For  the  entire  system  of  groups 

Hx,  H\,  H",  H"  !,..., 

and  consequently  the  group  common  to  all  of  them,  is  unaltered  by 
transformation  with  respect  to  G.  The  order  of  J  is  therefore 
obtained  by  dividing  that  of  H  by  s2. 

But  if  there  are  several  different  groups,  we  can  then  proceed 
in  the  same  way.  The  substitutions  common  to  Hx,  H'x,  H"x,  for 
example,  form  a  group  which  in  the  series  of  G  can  succeed  the 


106  THEORY    OF    SUBSTITUTIONS. 

group  composed  of  the  substitutions  common  to  Hx  and  H\ .     The 
corresponding  factor  of  composition  is  again  e. 

After  v  repetitions  of  this  process  we  arrive  at  the  group  J.  The 
order  of  J  is  therefore  obtained  by  dividing  that  of  H  by  ;".  The 
last  system  before  J  consists  of  v  groups  Hv_x,  H'v_1  .  .  .  which  are 
all  similar  and  all  belong  to  the  factor  s,  and  which  give 

H=  \H„_i,  H'v_l,H"v_l,  .,..[. 

Theorem  XXIX.  If  a  series  of  composition  of  G  does 
not  coincide  ivith  a  principal  series,  but  if,  between  two  groups  H 
and  J  of  the  latter,  v —  1  groups  HX,H.,,  .  .  .  Hv_x  of  the  former  are 
inserted,  then  to  Hu  H,,  ...  J  belong  the  same  factors  of  composition 
e,  and  the  order  r  of  G  is  therefore  equal  to  the  order  r"  of  J  mul- 
tiplied by  ev.  H  can  be  obtained  from  J  by  combining  with  J  a 
series  of  v  groups  Hv_x,  H'v_x,  .  .  .  ,  which  are  all  similar,  and  of 
the  order  r"e. 

Corollary  I.  //  the  factors  of  composition  of  a  group  are 
not  all  equal,  the  group  has  a  principal  series. 

Corollary  II.  Every  non-primitive  group  is  compound  if 
it  contains  any  substitution  except  identity  which  leaves  the  several 
systems  of  non-primitivity  unchanged  as  units.  If  the  group  con- 
tains greater  {including)  and  lesser  {included)  systems  of  non-prim- 
itivity,  it  has  a  principal  series. 

The  instance  of  the  group 

G  —  [1, (a?ia?2)  (xtxt)  {x5x6),  {xxx3)  {xoX^)  {xtx6),  {xtx6)  (x2xt)  {x3x,\, 

\XiXiXr1)  [XnX^X^f,  yX^X^X^f  yX^X^X^j J 

shows  that  non-primitivity  may  occur  in  a  simple  group.  In  this 
case  the  only  substitution  which  leaves  the  systems  xx,x2,  Xitx6i 
and  ;r4,  x6  unchanged  is  the  identical  substitution. 

Corollary  III.  The  groups  HV_„H.'V_UH."V-Xi  . . .  are 
commutative,  i.  e.,  the  equations  hold 


HV_^)HV.^  =  HV^HV. 


,(■>. 


For    in    the    series    preceding   J  we   may  assume   the   sequence 

if„_i,a',  \Hv_l(a),  Hv^^]\,  .  .  .  tooccur.     Accordingly  wemust  have 


GENERAL    CLASSIFICATION    OF    GROUPS.  107 

or 

{Hv_^y\Hv_^)-'Hv_^Hv_^Hv_^ 

Corollary  IV.  The  last  actual  group  M  of  the  principal 
series  of  G  is  composed  of  one  or  more  groups  similar  to  one  another, 
which  have  no  substitutions  except  identity  in  common,  and  which 
are  commutative  with  one  another. 

§  95.  We  have  now  to  consider  the  important  special  case 
where  e  is  a  prime  number  p. 

Instead  of  H'v_l,H"v_l,  ...  we  employ  now  the  more  conven- 
ient notation 

H',  H",  H'",  .  .  .  flW. 

Then  H'  is  obtained  from  J  by  adding  to  the  latter  a  substitu- 
tion tY ,  the  pth  power  of  which  is  the  first  to  occur  in  J.  We  may 
write  (§  91) 

H'  =  tfJ,    H"=tfJ,    H'"=tfJ,...    («  =  0, 1,  ...p  —  1). 

Since  J"  is  a  self-conjugate  subgroup  of  every  one  of  the  groups 
H',  H",  . .  .  ,we  have 

t1-«jt1a  =  j,   u-aJha  =  J,   t3-aJtia  =  J,... 

and,  if  we  denote  the  substitutions  of  J  by  ix ,  i, ,%,... ,  . 

t   —  a-i    —  1/  a  —  A  i   —  a,"   —  •/  a  —  A  f   —  a/   —  1/  a  —  A 

tiah  =  hV  (hh)  .     W  =  hka  (hh) ,     Uah  =  iAa  ihh),  •  •  •  . 

that  is,  the  substitutions  of  H',  of  H",  of  H'",  and  so  on,  are  com- 
mutative among  themselves,  apart  from  a  factor  belonging  to  J. 

Since  we  can  return  from  J  to  If  by  combining  the  substitutions 
of  H'  and  H",  for  example,  into  a  single  group  (§  88),  we  have  from 
§  94,  Corollary  III 

t.r  %t2  =  *,"*,,     tr  %~  %  =  t./i, , 
and  consequently,  by  combination  of  these  two  results, 

tl-%-'tlt,  =  t.m,   =t./+ii3, 

t--%  =  t/  +  %. 
The  left  member  of  the  last  equation  is  a  substitution  of  H',  the 


1<IS  THEORY    OF    SUBSTITUTIONS. 

right  member  a  substitution  of  H".  Since  these  two  groups  have 
only  the  substitutions  of  J  in  common,  the  powers  of  /,  and  /._,  must 
disappear.     Consequently  «  =  1,  /?  =  — 1,  and 

V 

(tli])(tX)  =  (tjjit^i.,, 
(t1H1)(t2H2)  =  (taH2)(t1H1)ii. 

The  substitutions  of  the  group  formed  from  J,  tt ,  and  t,  are 
therefore  commutative  among  themselves,  apart  from  a  factor  be- 
longing to  J.  The  same  is  true  of  the  group  formed  from  J,  tt , 
and  t,,  or  from  J,  t._,,  and  t:i,  and  consequently  of  the  group 
\J,  tx,L,  t3\,  and  so  on,  to  the  group  H  itself.  (It  is  to  be  noted 
that  Corollary  III  of  §  94  involves  much  less  than  this.  There  it 
was  a  question  of  the  commutativity  of  groups,  here  of  the  single 
substitutions. ) 

Every  two  substitutions  of  H  are,  then,  commutative  apart  from 
a  factor  belonging  to  J.  We  will  prove  now  the  converse  proposi- 
tion: If  two  substitutions  of  H  are  commutative  apart  from  a  fac- 
tor belonging  to  J,  then  £  is  a  prime  number.  In  fact  this  will  be 
the  case,  if  the  substitutions  of  H'  have  this  property.  For,  this 
being  assumed,  if  z  were  a  composite  number,  suppose  its  prime  fac- 
tors to  be  q,  q,  q",  .  .  .  We  select  from  H\ ,  in  accordance  with 
Theorem  XXIV,  §  01,  a  substitution  t  which  is  not  contained  in  J. 
The  lowest  power  of  t  which  occurs  in  J  will  then  be,  for  example, 
P.     Transforming,  we  have 

H'-l(taJ)H'=H'-ltaH'H'-lJI[' 
=  H'-HaH'J, 

and,  since  by  assumption,   taH'  —  H'taJ, 

H'-l(t«J)H'  =  t«J. 

The  group  ]t,  J{  is  therefore  a  self-conjugate  subgroup  of  H',  which 
contains  J  and  is  larger  than  J.  Moreover,  it  is  contained  in  H', 
and  is  smaller  than  H'.  For,  if  /  is  commutative  with  J,  then  from 
§§  37-8  the  order  of  \t,  J\  is  r"q  <  ?*"e.  This  is  contrary  to  the 
assumption  that  J  is  the  group  immediately  following  H'  in  the 
series  of  G. 


GENERAL    CLASSIFICATION    OF    GROUPS.  10& 

Theorem  XXX.  If,  in  the  principal  series  of  composi- 
tion of  G,  the  order  r  of  H  is  obtained  from  the  order  r"  of  J  by 
mult i plication  by  pv,  where  the  prime  number  p  is  the  factor  of  com- 
position for  the  intervening  groups  in  the  series  of  G,  then  the 
substitutions  of  H  are  commutative  among  themselves  apart  from 
factors  belonging  to  J.  Conversely,  if  this  is  the  case,  the  factors 
of  composition  of  the  groups  between  H  and  J  are  all  equal  to 
the  same  prime  number  p. 

§  96.  We  turn  finally  to  certain  properties  of  groups  in  rela- 
tion to  isomorphism. 

If  L  is  a  maximal  self-conjugate  subgroup  of  G,  and  A  the 
corresponding  group  of  /',  then  A  is  also  a  maximal  self -conjugate 
subgroup   of  r. 

For  if  /'  contained  a  self-conjugate  subgroup  0,  which  con- 
tained .1,  then  the  corresponding  group  T  of  G  would  contain  L. 

The  series  of  composition  of  G  corresponds  to  that  of  /'.  If 
{ i  and  F  are  simply  isomorphic,  all  the  factors  of  the  one  group  are 
equal  to  the  corresponding  factors  of  the  other.  But  if  G  is  mul- 
tiply isomorphic  to  I\  then  there  occur  in  the  series  for  G,  besides 
the  factors  of  V,  also  a  factor  belonging  to  the  group  S  which  cor- 
resjionds  to  the  identical  substitution  of  F. 

The  proof  is  readily  found. 

If  G  is  multiply  isomorphic  to  I',  then  G  is  compound,  and  S  is  a 
group  of  the  series  of  composition  of  G. 

§  97.  Suppose  that  G  is  any  transitive  group  of  order  r,  affect- 
ing the  n  elements  .rn  x,,  .  .  .  xlt.  We  construct  any  arbitrary  n\- 
valued  function  I  of  x:,  x2,,  .  .  .  x„,  denote  its  different  values  by 
r , ,  f> ,  .  .  .  ':„  < ,  and  apply  to  any  one  of  these,  as  r: ,  all  the  substitu- 
tions of  G.     Let  the  values  obtained  from  r,  in  this  way  be 

The  r  substitutions  of  G  will  not  change  this  system  of  functions  as 
a  whole,  but  will  merely  interchange  its  individual  members,  produ- 
cing r  rearrangements  of  these,  which  we  may  also  regard  as  sub- 
stitutions. These  substitutions  of  the  I's,  as  we  have  seen,  form 
a  new  group  /'.      The  group  r  is  transitive,  for  G  contains  substi- 


110  THEORY    OF    SUBSTITUTIONS. 

tutions  which  convert  I,  into  any  one  of  the  values  ?j ,  £a, . . .  fr , 
and  therefore  the  substitutions  of  /'  replace  £,  by  any  element 
?,,€s,  ...£r.  Again  every  substitution  of  Gr  alters  the  order  of 
■?!,!_.,  . .  .  ^,.,  for  I  is  a  n\- valued  function.  Consequently  every  sub- 
stitution of  /'also  rearranges  the  ?i,£a,...£r.  The  order  of  T  is 
therefore  equal  to  its  degree,  and  both  are  equal  to  r. 

G  and  /'  are  simply  isomorphic.  For  to  every  substitution  of  G 
corresponds  one  substitution  of  /',  and  conversely  to  every  substitu- 
tion of  /'at  least  one  substitution  of  G.  And  in  the  latter  case  it 
can  be  only  one  substitution  of  G,  since  G  and  /'are  of  the  same 
order. 

Theorem  XXXI.  To  any  transitive  group  of  order  r  cor- 
responds a  simply  isomorphic  transitive  grouj),  the  degree  and  order 
of  which  are  both  equal  to  r.     Such  groups  are  called  regular. 

§  98.  Theorem  XXXII.  Every  substitution  of  a  regular 
group,  except  the  identical  substitution,  affects  all  the  elements.  A 
regular  group  contains  only  one  substitution  which  replaces  a  given 
element  by  a  prescribed  element.  Every  one  of  its  substitutions 
coyisists  of  cycles  of  the  same  order.  If  two  regular  groups  of  the 
same  degree  are  {necessarily  simply)  isomorphic,  they  are  similar 
i.  e.,  they  differ  only  in  respect  to  the  designation  of  the  elements. 
Every  regular  group  is  non-prim  it  ire  * 

The  greater  part  of  the  the  theorem  is  already  proved  in  the 
preceding  Section,  and  the  remainder  presents  no  difficulty.  We 
need  consider  in  particular  only  the  last  two  statements. 

Suppose  that  /',  with  elements  ?x,  £2,  .  .  .  ?„  and  substitutions 
<rn  <*2, . . .  <r„  is  isomorphic  to  G  with  elements  .i\,  x.,,  .  .  .  x„  and 
substitutions  S[ ,  s2 >  •  •  •  s'« >  the  isomorphism  being  such  that  to  every 
<?a  corresponds  ,s-A.  Then  we  arrange  the  elements  xa  and  5p  in  pairs 
as  follows.  Any  two  of  them,  xx  and  I, ,  form  the  first  pair.  If 
then  sK  converts  .r,  into  .fA,  and  if  the  corresponding  <rA  converts  ^, 
into  lA,  then  X\  and  rA  form  a  second  pair.  No  inconsistency  can 
arise  in  this  way,  for  there  is  only  one  substitution  which  converts 
a?,  into  xa.  We  have  now  to  prove  that,  if  sA  contains  the  succes- 
sion xaxb,  then  nx  contains  the  succession  $a  ?j. 

*A  regular  group  of  prime  degree  is  cyclical. 


GENERAL    CLASSIFICATION    OF    GROUPS.  Ill 

We  have 

Sf,  —  .  .  .  XyX,,  .  .  .  ,       S),  —  ,  .  .  A  ]►((,  .  .  .  ,       Sa       S/,  —  .  .  .  <7  „.< /,..., 

"V,  —    •   •   •    "l^-i   •   •   •  )  "i  —    ...   C]  ?;,...   ,  ff„         ""/,  —    ...   •?„?,,   .   .    .   , 

and  since  there  is  only  one  substitution  which  replaces  x„  by  xb,  it 
follows  that 

If  therefore  sa  contains  a  cycle  composed  of  a  given  number  of  ele- 
ments xa,  then  aK  contains  an  equal  cycle  composed  of  the  corres- 
ponding elements  Sa.  Therefore  sx  and  c^,  and  consequently  G 
and  /'  are  of  the  same  type. 

The  last  part  of  the  theorem  is  proved  as  follows.  If  a  regular 
group  G  contains  a  substitution  8  =  {xAx2  .  .  .  x„)  (x,„  +  lx„l  +  2.  ..)... 
then  it  cannot  also  contain  t  =  {xxx2 . .  .)  (xixm+2.  ..)...  For  we 
should  then  have  st~  1=(x1)  (xm+1xt ...)...,  and  G  would  not  be  a 
regular  group.  Consequently  xl,  x2,  .  .  .  xm,  i.  e.,  the  elements  of  any 
arbitrary  cycle,  form  a  system  of  nonprimitivity.  (The  remaining 
systems  however  are  not  necessarily  formed  from  the  remaining 
cycles  of  the  same  substitution). 

§  99.  If  the  groups  G  and  /'are  isomorphic,  and  if  G  is  intran- 
sitive, then,  if  in  every  substitution  of  G  we  suppress  all  elements 
which  are  not  transitively  connected  with  any  one  among  them,  as 
a1!,  the  remaining  portions  of  the  several  substitutions  form  a  new 
transitive  group  Gx  also  isomorphic  with  /'.  It  may  however  hap- 
pen that  the  order  of  isomorphism  of  /'to  Gx  is  increased.  Again, 
if  x.,  is  any  new  element,  not  transitively  connected  with  acj ,  we  can 
then  form  a  second  transitive  group  G2,  isomorphic  to  /'  and  con- 
taining a?2j  and  so  on. 

The  intransitive  group  G  can  therefore  be  decomposed  into  a 
system  of  transitive  groups  isomorphic  with  /',  and  conversely  even- 
intransitive  group  can  be  compounded  from  transitive  groups 
Gx,  G2,  .  ■  .  In  the  case  of  simple  isomorphism  it  is  only  neces- 
sary to  multiply  the  several  constituents  directly  together. 

§  100.  Suppose  that  G  is  a  transitive  group  of  degree  m  and 
order  r  =  mmu  which  is  A'-fold  isomorphic  with  a  second  group 
/'.  Let  the  elements  of  G  be  xu  x2,  .  .  .  xm,  and  let  Gx  be  the  sub- 
group of  G  which  does  not  affect  x{ .     The  order  of  Gx  is  therefore 


1  1  2  THEORY    OF    SUBSTITUTIONS. 

m,.     If    Sj.N;,...    are   substitutions  of  G   which  convert   .<■,   into 
<•  ,  .'....  then  (?]  •  s,,  (?,  •  s:t,  .  .  .  comprise  in  each  case  all  and  only 
the  substitutions  which  produce  the  same  effects. 

Suppose   that   to   (?,  in  G  corresponds   /',   in   /',    the   order  of 
/',  being  //?,A\     The  order  of  /'  is   rk.     Consequently,  if  the  func- 

vk 
tion  cr,  belongs  to  /', ,  then  cr,  takes  exactly  ■ — -  —  m  values  under  the 

operation  of  all  the  substitutions  of  /'.  Suppose  that  the  substitu- 
tion <t,  of  /'  which  corresponds  to  s.,  of  G  converts  cr,  into  <p%.  Then 
/'•  t,  contains  all  the  substitutions  which  convert  cr,  into  cr,.  Simi- 
lar considerations  hold  for  az  and  cr;j,  <r4  and  y>4,  and  so  on  to  am  and 
c,„.     If  we  apply  all  the  substitutions  of  /'  to  the  system  of  values 

rii  r2>  •  ■  »r«) 

we  obtain  rearrangements  which  can  be  regarded  as  substitutions  of 
the  new  elements  <p.  The  order  of  the  new  group  H  is  equal  to  the 
quotient  of  kr  by  the  number  of  substitutions  of  / '  which  leave  all 
the  cr's  unchanged.  These  correspond  to  the  substitutions  of  G 
which  leave  all  the  .r's  unchanged,  i.  e.,  to  the  identical  substitu- 
tion. To  this  correspond  k  substitutions  of  / ',  and  consequently  the 
order  of  if  is  /•. 

G  and  H  are,  then,  the  same  degree  ?«,,  of  the  same  order  ?•,  and 
they  are  isomorphic  and,  in  fact,  similar.  For  if  s  is  a  substitution 
of  G  which  replaces  .rs  by  xa,  then  8  belongs  to  the  system  sa~lG1Sp. 
The  corresponding  substitution  of  H  is  obtained  by  applying  a  sub- 
stitution tra—  1ri<rp  to  the  system  cr,,  tpu  .  .  .  tr/((.  Every  one  of  these 
substitutions  replaces  cra  by  cr^.  Accordingly  the  substitutions  of  H 
only  differ  from  those  of  G  in  the  fact  that  the  latter  contain  a-'s 
where  the  former  contain  the  corresponding  c"s. 

We  can  therefore  construct  all  groups  G  (or  H)  isomorphic  to  /' 
by  applying  all  the  substitutions  of  /'to  any  function  cr  belonging  to 
any  arbitrary  subgroup  /',  of  l\  and  noting  the  resulting  group  of 
substitutions  of  the  elements  cr,,  cr.,,  .  .  .  <pm. 

If  /',  is  a  self-conjugate  subgroup  of  /',  the  resulting  isomorphic 
group  //  will  be  regular,  as  is  easily  seen. 

$  101.     In  conclusion  we  deduce  the  following 

Theorem  XXXIII.  Given  any  number  of  mutually  mul- 
tiply isomorphic  groups,  in   ichirlt   the    elements  of   any  one  are 


GENERAL    CLASSIFICATION    OF    GROUPS.  113 

all  different  from  those  of  any  other  one,  if  we  multiply  every  sub- 
titution  of  the  one  (/roup  by  every  corresponding  substitution  of 
every  other  group  and  form  all  the  possible  products,  the  result 
is  an  intransitive  (/roup,  and  conversely  every  intransitive  group 
can  be  constructed  in  this  way. 

The  first  part  of  the  theorem  is  sufficiently  obvious.  For  the 
second  part  we  consider  the  special  case  of  an  intransitive  group 
the  elements  of  which  break  up  into  two  transitive  systems.  The 
general  proof  is  obtained  in  a  perfectly  similar  way. 

Suppose  that  the  substitutions  sA  of  the  intransitive  group  G 
divide  into  two  components 

where  ta  affects  only  the  elements  as,  ,x2,  ...  xm ,  and  rA  only 
£,,£, r^.  It  is  possible  that  ta  occurs  also  in  other  combina- 
tions 

/  r  t 

Kh'ki     '~\~  A  i     ffV      A,   •   •   • 

Similarly  rA  may  occur  in  other  combinations 

r  f  f 

"A^A,     '7  A~A,     0    A~A   •   •    • 

We  coordinate  now  with  ta  all  the  rA,  r\,  r"A,  .  .  .  ,  and  with  rA  all 
the  <T\,  <?\,  <?" k,  .  .  .  ,  and  proceed  in  the  same  way  with  all  the  sub- 
stitutions sA  of  G.  The  <rA's  form  a  group  2'  and  the  rA's  a  group 
'/'.  Suppose  that  ta.  'v  are  coordinated  with  "a,7^.  Then  there 
are  substitutions  Sa,s^,sv,  such  that 

Sa  =  ^  ArA  )     -SV  =  rVTlu.  5 
S\Sn  —  Sv  —  »>■>) 

and  consequently  ta^  =  <rv  is  coordinated  with  rAr^  =  r„. 


8 


CHAPTER    V. 


ALGEBRAIC  RELATIONS  BETWEEN  FUNCTIONS  BELONGING 
I'o  THE  SAME  GROUP.     FAMILIES  OF  MULTIPLE- 
VALUED  FUNCTIONS. 

§  1<  )'l.  It  has  been  shown  that  to  every  multiple-valtied  func- 
tion there  belongs  a  group  composed  of  all  those  substitutions  and 
only  those  which  leave  the  value  of  the  given  function  unchanged. 
Conversely,  we  have  seen  that  to  every  group  there  correspond  an 
infinite  number  of  functions.  The  question  now  to  be  considered 
is  whether  the  property  of  belonging  to  the  same  group  is  a  funda- 
mentally important  relation  among  functions;  in  particular,  whether 
this  property  implies  corresponding  algebraic  relations. 

An  instance  in  point  is  that  of  the  discriminant  J0  of  the  values 
of  a  function  cr,  considered  in  Chapter  III,  §  55.  It  was  there  shown 
simply  from  the  consideration  of  the  group  belonging  to  cr,  that  Jlt, 
and  therefore  the  corresponding  discriminant  of  any  function 
belonging  to  the  same  group,  is  divisible  by  a  certain  power  of  the 
discriminant  of  the  elements  x1,xi,  .  .  .  xn. 

§  103.  We  shall  prove  now  another  mutual  relation  of  great 
importance. 

Theorem  I.  Two  functions  belonging  to  the  same  group 
'■an  hi'  rationally  expressed  our  in  terms  of  the  other. 

Suppose  c,  and  </',  to  be  two  functions  belonging  to  the  same 
group  of  order  /•  and  degree  n 

Gt  =[s,  =  1,  S2,  83,  .  ..  8,  ]. 

If  <r2  IS  an.V  substitution  not  belonging  to  (V, ,  and  if  f ,  and  <.'■_,  are  the 
values  which  proceed  from  cr,  and  </-,  by  the  application  of  er2,  then 
all  the  substitutions 

rr2,    82<T2,    ggfl-jj,  .  .  .  8,.«T2 

also  convert  cr,  and  ff  into  X\  and  t,',,  respectively,  and  these  are  the 
*only  substitutions  which  produce  this  effect.     The  values  cr.,  and  t/'2 


FUNCTIONS    BELONGING    TO   THE    SAME    GROUP. 


L15 


therefore  again  belong  to  one  and  the  same  group  G.,  =  v., "x(ixn.. . 
Proceeding  in  the  same  way,  we  obtain  all  the  p  pairs  of  values  of 
<f  and  </-,  together  with  the  p  corresponding  groups. 
For  every  integral  value  of  X ,  the  function 


cr,V,  +  cA\+  .  .  .  +<pM 


r    A,'. 


A, 


-f-  c''p,  an  inte- 
.r,,.     For   this 


is  therefore,  like   e,  +  <fi  +  ■  •  •  +  <?P  or  c\  -(-  4\  +  • 

gral  symmetric  function  of  the  elements  .r,,. «•_.,. 

function  is  merely  the  sum  of  all  the  values  which  v,\''i  can  assume 

and  is  accordingly  unchanged  by  any  substitution,  only  the  order 

of  the  several  terms  being  affected.     Accordingly,  if  <r,  and  c'1,  are 

integral  rational  functions  of  the  elements  .rA,  then  AK  is  an  integral 

rational  function  of  cn  <•,,  .  .  .  c„. 

Taking  successively   /.  =  0,  1,  2,  .  .  .  <>  —  1,  we    write    tbe  corres- 
ponding equations: 


',+ 


4'*  + 


<r\  + 


S) 


9l4'l  +  ft&  +  WV+ 


p,V,  4- 


PlP~Vl  +  ««,~ty2+"SV'~tys  + 


.+ 

.+ 

<rpv''p  =AU 

.+ 

V  p  V  p  —  -9-2  i 

4-ffP-U    —4 

.  .  .  c''p,  every  4'k  is  obtained 


If  these  equations  are  solved  for  </', ,  c'\, 
as  a  rational  function  of  <fx ,  <s...  .  .  .  <sp. 

§  104.  We  multiply  the  first  <>  —  2  equations  of  the  system  S) 
successively  by  the  undetermined  quantities  y0,  //,,  >j, .  .  .  yp-2,  and 
the  last  equation  by  yp  _,  =  1,  and  add  the  resulting  products,  wri- 
ting for  brevity 


l  i 


yP-x<;p  l-ryP-i9p~i+yP-s<pp  *+•■■  -f yi? +y0  = x(<p)- 

We  obtain  then 

(l )    <\  y.  ( <?i)  +  4>t  /.  (?«)  + . . .  4'Px  M  =  A>y*  -f  am  +  ^2  +  • . . 

.  .  .  +  ^-p-:Up -2-\-Ap_lyp_1. 

From  this  equation  we  can  eliminate  c\,,  <.'\;,  .  .  .  4'P  and  obtain  c'',. 
For  this  purpose  we  need  only  select  the  f/'s  so  that  we  have  simul- 
taneously 

x(n)  =  0,    z(f,)  =  0,  ...  /(cP)  =  ();      z("ft)+& 


Ill)  THEORY    OF     SUBSTITUTIONS. 

In  Chapter  III,  £  53,  we  have  shown  that  p,,  c:j  . . .  <pp  satisfy  an 
equation  of  degree  r> 

-V(c)  =  0, 

the  coefficients  of  which  are  rational  in    '*,,<:■_,,  .  .  .  c„.     Again,  the 

quotient 

X(<p) 

—  VP—V*)  {9—9%)  ■  ■  •  {?—  99) 


9—9\ 

vanishes  if  c  =  cfj,  e\,,  .  .  .  crp.     But,  if  <p  =  <sx,  we  have 
(<Pi  —  9a)(9i~ 9s)  ■  ■  ■  (Vi  —  9P)  =  A"(cr,). 

The  derivative  A"(vri)  is  not  zero,  for  if  .r, ,  .<•_,,  .  .  .  .r„  are  independ- 
ent, the  values  c-,,  c, ,  .  .  .  cp  are  all  different. 

We  can  therefore  satisfy  the  requirements  above  by  taking 

r        r  1 

that  is, 

Up      .'  =  'j-        ,'/p      .=.:?:i)       !/i>-t  =  -       V    ■  ••!/>, =    ±.'p- 

Or,  if  we  write 

A'(cr)  =  crP  —  a,  ?P"  '  -f  a.,c>>     *—'...  ±  ap, 

we  have 

^\-=9"-1+[.<Pi  —  *i]<P('-2  +  [<P12-«i<?l  +  «i]<Pp-*+  ..., 
9  —  9\ 

and  consequently 

By  substitution  in  (1)  we  obtain  then 

(2)  <!>,X'(<Pl)=R{<P,\     *i  =  w^' 

The  value  of  </',  thus  obtained  can  be  reduced  to  a  simpler  form 
as  follows.     The  product 

A-'|cI)A-'(c,)...A-'(cp) 

is  a  symmetric  function  of  the  c's,  and  in  fact,  as  appears  from  the 
expression  for  X'ic,)  above,  only  differs  from  the  discriminant  J,, 
in  algebraic  sign.     Moreover,  the  product 

(3)  AV_.)A"(V3)...  A'(ep) 

is  a  symmetric  function  of  the  roots  of  the  equation 


FUNCTIONS    BELONGING    TO    THE    SAME    GROUP.  117 

9  —  9i 
and  can  therefore  be  rationally  expressed  in  terms  of  the  coefficients 
of  this  equation,  that  is,  in  terms  of  an  «.,,  .  . .  ap,  and  y>l}  and  con- 
sequently in  terms  of  c^c.,,  .  .  .  c„  and  plt  If  now  we  multiply 
numerator  and  denominator  of  the  expression  for  4>\  in  (2)  by  the 
product  (3),  we  obtain 

(4)  *  =  ^>. 

The  denominator  of  this  last  fraction  is  rational  and  integral  in 
c, ,  c, ,  .  .  .  c„ ;  the  numerator  is  rational  and  integral  in  c, ,  c, ,  .  .  .  c„ 
and  c, . 

If  the  numerator  -R^c'i)  is  of  a  degree  higher  than  p —  1  with 
respect  to  c,,  a  still  further  reduction  is  possible.  For  suppose 
that 

where  Q(c)  and  R,(<f)  are  the  quotient  and  remainder  obtained  by 
dividing  Rfa)  by  X{<p).  The  degree  of  R,(<f)  then  does  not  exceed 
p —  1.      Now  if  9  =  cr,,  Co,  .  .  .  cp,  X((f)  =  0.     Consequently 

BlM=BiM     (/=1,  2,3,  ...»), 
and  therefore 


9i 


Jo 


Similar  considerations  hold  for  the  values  <,':> ,  cV. ,  .  .  .  c''p .  We 
have  therefore 

Theorem  II.  If  two  p -valued  functions  <p\  and  4\  belong  to 
the  same  group  GK,  then  <p\  can  be  expressed  as  a  rational  fund  inn 
of  ivhich  the  denominator  is  the  discriminant  J,.,  and  is  therefore 
rational  and  integral  in  cn  c_,,  .  .  .  c„,  while  the  numerator  is  an 
integral  rational  function  of  <fK,  of  a  degree  not  exceeding  />  —  1, 
with  coefficients  ivhich  are  integral  and  rational  in  cn  c,,  . .  .  cH* 

§  105.     The  converse  of  Theorem  I  is  proved  at  once: 

Theorem  III.  If  two  functions  can  be  rationally  cr. 
pressed  one  in  terms  of  the  other,  they  belong  to  the  same  group. 

*Cf.  Krouecker:  Crelleoi.  p.  307. 


lis  THEORY    OF   SUBSTITUTIONS. 

In  fact,  given  the  two  equations 

it  appears  from  the  former  that  <s  is  unchanged  by  all  substitutions 
which  leave  <,'•  unchanged,  so  that  the  group  of  y  contains  that  of  <f>, 
while  from  the  latter  equation  it  appears  in  the  same  way  that  the 
group  of  c''  contains  that  of  y.  The  two  groups  are  therefore  iden- 
tical. 

Remark.  Apparently  the  proof  of  this  theorem  does  not  involve 
the  requirement  that  c  and  <f>  shall  be  rational  functions.  It  must 
however  be  distinctly  understood  that  this  requirement  must  always 
be  fulfilled.     For  example,  in  the  irrational  functions 


the  expressions  under  the  square  root  sign  are  all  unchanged  by 
the  transposition  a  =  {x1x2).  But  it  remains  entirely  uncertain 
whether  the  algebraic  signs  of  the  irrationalities  are  affected  by  this 
substitution.  Considerations  from  the  theory  of  substitutions  alone 
cannot  determine  this  question,  and  accordingly  the  sphere  of  appli- 
cation of  this  theory  is  restricted  to  the  case  of  rational  functions. 
If,  in  the  last  two  irrationalities  above,  the  roots  are  actually 
extracted  and  written  in  rational  form 

±{x1  —  x2),      ±(x1  +  x2), 

it  appears  at  once  that  the  transposition  a  changes  the  sign  of 
the  former  expression  but  leaves  that  of  the  latter  unchanged, 
while  in  the  case  of  the  first  irrationality  this  matter  is  entirely 
undecided. 

$  106.  Theorems  I  and  III  furnish  the  basis  for  an  algebraic 
classification  of  functions  resting  on  the  theory  of  groups.  All 
rational  integral  functions  which  can  be  rationally  expressed  one 
in  terms  of  another,  that  is,  which  belong  to  the  same  group,  are 
regarded  as  forming  a  family  of  algebraic  functions.  The  number 
ji  of  the  values  of  the  individual  functions  of  a  family  is  called  the 
order  of  the  family.  The  several  families  to  which  the  different 
values  of  any  one  of  the  functions  belong  are  called  conjugate 
families.* 

*  L.  Kronecker:  Monatsber.  d.  Her\.  Akad..  L879,  p.  212. 


FUNCTIONS   BELONGING    TO    THE    SAME    f4ROUP.  119 

The  product  of  the  order  of  a  family  l>y  the  order  of  the  cor- 
responding (/roup  is  equal  to  u\,  where  n  is  the  degree  of  the  group. 

Every  function  of  a  family  of  order  p  is  a  root  of  an  equation 
of  degree  />,  the  coefficients  of  which  are  rational  in  cn  c2,  .  .  .  cn. 
The  remaining  <>  —  1  roots  of  this  equation  are  the  conjugate  func- 
tions. 

The  groups  which  belong  to  conjugate  families  have,  if  p  >  2, 
n  >  4,  no  common  substitution  except  the  identical  substitution. 

For  p  =  2  tlie  two  conjugate  families  are  identical. 

For  [>  =  Q,  u  =  4  there  is  a  family  which  is  identical  with  its 
five  conjugate  families. 

§  107.  In  the  demonstration  of  §  104  the  condition  that  c  and 
<!>  should  belong  to  the  same  family  was  not  wholly  necessary.  It  is 
only  essential  that  (p  shall  remain  unchanged  for  all  those  substitu- 
tions which  leave  the  value  of  c  unaltered.  '  The  demonstration 
would  therefore  still  be  valid  if  some  of  the  values  of  c'*  should 
coincide;  but  the  values  of  <?  must  all  be  different,  as  appears,  for 
example,  from  the  presence  of  the  discriminant  J^  in  the  denomi- 
nator of  </'.  Under  the  more  general  condition  that  the  group  of 
v''  includes  that  of  <?  we  have  then  the  following 

Theorem  IV.  //  a  function  ^  is  unchanged  by  all  the  sub- 
stitutions of  the  group  of  a  second  function  <f,  while  the  converse  is 
not  necessarily  true,  then  c''  can  be  expressed  as  a  rational  function 
of  <f,  as  in  Theorem  II. 

Under  these  circumstances  the  family  of  the  function  e">  is  said 
to  be  included  in  the  family  of  the  function  c.  <.'•  can  be  rationally 
expressed  in  terms  of  <f,  but  <p  cannot  in  general  be  thus  expressed 
in  terms  of  </'•  A.n  including  group  corresponds  to  an  included  fam- 
ily and  vice  versa.  The  larger  the  group  the  smaller  the  family, 
the  same  inverse  relation  holding  here  as  between  the  orders  r 
and  i>. 

From  the  preceding  considerations  we  further  deduce  the  fol- 
lowing theorems: 


120  THEORY    OF    SUBSTITUTIONS. 

Theorem  V.  It  is  always  possible  to  find  a  function  in 
terms  of  which  any  number  of  given  functions  can  be  rationally 
expressed.  This  function  can  be  constructed  as  a  linear  combina- 
tion of  the  given  functions.  Its  family  includes  all  the  families 
of  the  given  functions. 

Thus  any  given  functions  cr,  0,  /,  .  .  .  can  be  rationally  expressed 
in  terms  of 

m  =a<p  +  ^0  +  r7+  •  •  •  » 

where  a,  /9,  y,  . . .  are  arbitrary  parameters.  For  the  group  of  w  is 
composed  of  those  substitutions  which  leave  c- .  <.'• ,  ■/ ,  .  .  .  all  un- 
changed, and  which  are  therefore  common  to  the  groups  of 
c  ,(.'■,  ■/ ,  .  .  .  The  group  of  m  is  therefore  contained  in  that  of 
every  function  <p .  <.'• ,/,...  ,  and  the  theorem  follows  at  once. 

A  special  case  occurs  when  the  group  of  to  reduces  to  the 
identical  operation,  o>  being  accordingly  a  n '.-valued  function.  In 
this  case  every  function  of  the  n  elements  xt,  x2,  .  . '.  0C„  can  be 
rationally  expressed  in  terms  of  <»,  and  every  family  is  contained 
in  that  of  w.     The  family  of  <"  is  then  called  the  Galois  family. 

Theorem  VI.  Every  rational  function  of  n  independent 
elements  xl,x2,  .  . .  x„  can  be  rationally  expressed  in  terms  of  every 
nl-valued  function  of  the  same  elements:  in  particular^  in  terms 
of  any  linear  function 

<f  =  '^.x\-\-a.,._i\,  .  .  .  +«„. r„, 

ivhere  «, ,  a., ,  .  .  .  a„  are  arbitrary  parameters. 

§  108.  We  attempt  now  to  find  a  means  of  expressing  a  mul- 
tiple-valued function  <s  in  terms  of  a  less  valued  function  c',  the 
group  of  the  former  being  included  in  that  of  the  latter.  A  rational 
solution  of  this  problem  is,  from  the  preceding  developments,  im- 
possible. The  problem  is  an  analogue  and  a  generalization  of  that 
treated  in  Chapter  III,  §  53,  where  a  /'-valued  function  was 
expressed  in  terms  of  a  symmetric  function  by  the  aid  of  an  equa- 
tion with  symmetric  coefficients  of  which  the  former  was  a  root. 

From  the  analogy  of  the  two  cases  we  can  state  at  once  the 
present  result: 


FUNCTIONS  BELONGING  TO  THE  SAME  GROUP.  121 

Theorem   VII.     If  the  group  of  a   m,"- valued  function  c  i* 
contained  in  that  of  a  /> -valued  function  0,  and  if 

9\*9l1  ■   ■   ■   9« 

are  the  in  values  ivhich  <p  takes  under  the  application  of  all  the 
substitutions  which  leave  (p  unchanged,  then  these  m  values  of  <f  are 
the  roots  of  an  equation  of  degree  m,  the  coefficients  of  which  are 
rational  functions  of  0. 

In  fact,  the  substitutions  of  the  group 

n\ 
Gl  —  [s,  —  1,  s, ,  s3 ,  .  .  .  sr]      r  =  — 

of  c\  are  applied  to  any  symmetric  function  of  <pu  93, . . .  <f,„.  the 
value  of  this  function  is  unchanged,  only  the  order  of  the  several 
terms  being  altered.  In  particular  we  have  for  the  elementary 
functions 

9i  +  9%      -f.-.+f-.  =^i(0i), 

9l9l  +  9\9%  +  •  •  •   +  9m-l9m  ~  M$\\ 


9i92  ■  •  •  9m  =  Am(4>x), 

where  the  A's  are  rational,  but  in  general  not  integral  functions  of 
(pt .     We  obtain  therefore  the  equation 

(A,)  <pm  —  A,  fa)  r  -  >  +  A2  fa,)  ?— •-'  +  .  i  .  ±  Am  fa)  =  0, 

of  which  the  roots  are  <fx ,  <p 2 , . . .  <s„, ,   and  in  general  the  equation 

(AK)  9m—Al(9i)<pm-1+A2(<pK)¥m-*+  .  .  .  ±  Am{9x\ 

of  which  the  roots  are  the  m  values  of  c  which  correspond  to  the 
value  <J>\  of   t'. 

The  denominators  of  the  AA's  and,  in  fact,  their  least  common 
denominator  is  always  a  divisor  of  the  discriminant  Jc,  as  appears 
from  the  proof  of  Theorem  II.  If  (j.'  is  a  symmetric  function,  there 
is  no  longer  a  discriminant,  and  the  denominator  is  removed,  as  we 
have  seen  in  Chapter  III,  §  53. 

§  109.  One  special  case  deserves  particular  notice.  If  the 
included  group  H  of  the  function  <s  is  commutative  with  the  inclu- 
ding group  G  of  c''  then,  if  a  single  root  of  the  equation  (A,  I  is 
known,  the  other  roots  are  all  rationally  determined.     For  if 


122 


THEORY    OF    SUBSTITUTIONS. 


are  tbo  roots  of  the  equation  (^i),  and  if 

Hi,  H2,HS, . . .  H,„ 
are  the  groups  belonging  to  these  values,  finally,  if 

01  =  1,  02)  ff8  •  •  •  ""« 


are  any  arbitrary  substitutions  of  6?  which  convert  cr,  into  cr, .  c. ,  ■ 
respectively,  then  we  have  (Chapter  III,  §  45) 


9m 


H}  =  *r  lH} iru  H2=  02 ~ lH, «, 


H  ,„  —  0     H^,,,. 


But  by  supposition  if  is  a  self-conjugate  subgroup  of  6?,  and  there- 
fore 

G~  H\  G  —  Hi , 
that  is, 

ff2   'H^  =  if, ,    03"  'H,*,  =  if, ,  ...  0m~  'fllff.  =  if! , 

and  consequently 


H,  —  H.,  —  if  >  — 


if,, 


The  at  different  values  cr,,  cr_,,  .  .  .  <pm  therefore  belong  to  one  and  the 
same  group  H,  and  can  consequently  all  be  rationally  expressed  in 
terms  of  any  one  among  them,  in  accordance  with  Theorem  I. 

The  family  of  <.'',  is  included  in  that  of  cr, .  When,  as  in  the 
present  case,  the  group  H}  of  y>,  is  not  merely  contained  in  the 
group  G  of  4'\  but  is  a  self-conjugate  subgroup  of  G,  the  family  of 
t'1,  is  called  a  self-conjugate  subfamily  of  the  family  of  cr, . 

Theorem  VIII.  In  order  that  all  the  roots  of  the  equation 
(Ax)  should  be  rationally  expressible  in  terms  of  any  one  among 
them,  as  cr, ,  it  is  necessary  and  sufficient  that  the  family  of  <.'-, 
should  be  a  self -conjugate  subfamily  of  that  of  cr,,  i.  e.,  that  the 
groti))  of  v,  should  be  a  self -conjugate  subgroup  of  that  of  t'-, .  The 
groups  of  cr,,  cr_,,  .  .  .  c„,  are  then  coincident. 

We  consider  in  particular  the  case  where  m  is  a  prime  number. 
Suppose  G?]  to  be  the  group  of  4'i  and  Hi  that  of  cr, .  Since  every 
substitution  of  (?,  produces  a  corresponding  substitution  of  the  val- 
ues Cj,  9u  ■  ■  •  9mi  the  group  Cr,  is  isomorphic  with  a  group  of  the 
cr's.  The  latter  group  is  transitive  and  of  degree  m.  From  The- 
orem II,  Chapter  IV,  its  order  is  divisible  by  m,  and  from  Theorem 
X,  Chapter  III,  it  therefore  contains  a  substitution   of  order   m. 


FUNCTIONS    BELONGING    TO    THE    SAME    GBOUP.  123 

For  ///   elements,  where   m  is  prime,  there  is  only  one  type  of  such 
substitutions 

t  =  (ft  ft  ■  •  •  ft.)- 

The  corresponding  substitution  r  of  G,  therefore  permutes 
ft>  ftj  •  •  •  'r.n  cyclically.  Moreover,  since  -'"  corresponds  to  /"',  it  fol- 
lows that  -'"  leaves  all  the  functions  <plf  c.,,  ...  <pm  unchanged.  Ac- 
cordingly r ",  and  no  lower  power  of  r,  is  contained  among  the  sub- 
stitutions of  Hl . 

Furthermore  we  readily  show  that 

Gx  =  \H„t\. 

For  the  substitutions  if,,  ff,r,  .  .  .  ff,7'"_1  are  all  different  and,  since 

Ht  is  of  order  — -,  there  are  m  — -  =  --  of  them.     They  are  all  nec- 
m;>  mp       i> 

n ! 
essarily  contained  in   Gr, ,  which,    being  itself  of  order     — ,  cannot 

P 
contain  any  other  substitutions.     From  this  it  appears  again  that  r 

is  commutative  with  Hx . 

Theorem  IX.  If  the  equation  (A,)  is  of  prime  degree  m, 
and  if  the  group  Hx  of  tpx  is  a  self -conjugate  subgroup  of  the 
group  G-'i  of  ft,  then  Gx  contains  a  substitution  r  which  permutes 
y>i,  <Pzi  ■  ■  ■  fp  cyclically.  This  substitution  is  commutative  with 
H} ;  its  mth,  and  no  lower,  power  is  contained  in  Hx ;  together  with 
Hx  it  generates  the  group  Gr, . 

§  110.  We  examine  now  under  what  circumstances  (Aj)  can 
become  a  binomial  equation,  again  assuming  the  degree  m  to  be  a 
prime  number.  If  (Ax)  is  binomial,  its  roots,  cr, ,  wcr,,  a»Vij  •  •  •  ">'"_  Vi 
evidently  all  belong  to  the  same  group.  It  is  therefore  necessary 
that  tyj  should  be  a  self -conjugate  subgroup  of  Gx. 

We  proceed  now  to  show  conversely  that,  if  the  group  if,  is  a 
self-conjugate  subgroup  of  (?, ,  then  a  function  yA  belonging  to  H} 
can  be  found,  the  mth  power  of  which  belongs  to  (?, . 

Denoting  any  primitive  mth  root  of  unity  by  w,  we  write 

Xl   =  ft  +  <»?>  +  "V:;  ■+-...+  «"  "  V«  • 

If  we  apply  to  this  expression  the  successive  powers  of  t  or  r,  we 
obtain 


J  2  \  THEORY    OF    SUBSTITUTIONS. 


/.■  =  9a  +  to9»  +  '"'fi  +  • 

•  •  -f  <"'" " 

~Vl    =   «»        '/l, 

/:  —  9*  +  ">9i  +  <"V:.  +   •  ■ 

■  +  ">m  - 

Va  =  "'~a^i) 

consequently 

We  have  now  to  prove  1)  that  yx  belongs  to  the  group  Ht ,  and 
2)  that  ■/_{'  belongs  to  the  group  Gr, . 

In  the  first  place,  since  <fn  ?-.,...  $-",„  are  unchanged  by  all  the 
substitutions  of  Hx ,  the  same  is  true  of  yA .  Moreover  if  there  were 
any  other  substitutions  which  left  /,  unchanged  we  should  have,  for 
example, 

9,  +  <»9a  +  •  •  •  +  »"  -  V„  =  9t,  +"9*  +  •  •  •  +  <»'"  ~  V     ■ 

and  therefore 

"'"'-'(V.,.  —  pJ +  »"-'(*»— i— ?,„_,)  +  . .  .+(?,— ^)  =  o. 

The  latter  equation  would  then  have  one  of  its  roots,  and  conse- 
quently all  its  roots,  in  common  with  the  irreducible  equation 

and  we  must  therefore  have 

9\—9iy  —  92—9ii=  •  •  •  =  9m — 9im> 
But  we  may  assume  the  function  ^,  to  have  been  constructed  by  the 

method  of  §  31  as  a  sum  of      -  terms  of   the  form  xfxfi  .  .  .    with 
°  mp 

undetermined  exponents.  The  systems  of  exponents  in  c,,  c,,,  .  .  .  c,„ 
will  then  all  be  different,  and  therefore,  since  the  x's  are  independ- 
ent variables,  the  equation 

9i  +  9i3=92  +  9ii 

can  hold  only  if  tpx  —  <p^  and  ¥>i  =  <pii  identically.  The  function  /, 
therefore  belongs  to  Hx. 

It  follows  at  once  that  /,'"  belongs  to  67, .  For  this  function  is 
unchanged  by   Hx  and  r,  and  consequently  by 

Q1  =  \H1,t\, 

No  other  substitutions  can  leave  /,'"  unchanged.  For  otherwise 
/,'"  would  take  less  than  p  values,  and  its  mth  root  /,  less  than  mp 
values,  which  would  be  contrary  to  the  result  just  obtained. 


FUNCTIONS    BELONGING    TO    THE    SAME    GROUP.  125 

Theorem  X.     In  order  that  the  family  belonging  to  a  group 

H  may  contain  functions  the  mth  power  of  which  belongs  to  the 
family  of  a  group  G,  it  is  necessary  and  sufficient  that  H  should  be 
a  self -conjugate  subgroup  of  G,  or,  in  other  words,  that  the  family 
of  G  should  be  a  self- con  jug  ate  subfamily  of  that  of  H. 

From  Theorems  IX  and  X  the  following  special  case  of  the  lat- 
ter is  readily  deduced: 

Theorem  XI.  In  order  that  the  prime  power  </''  of  a  pp- 
valued  function  c  may  have  p  values,  it  is  necessary  and  sufficient 
that  there  should  be  a  substitution  r,  commutative  with  the  group  H 

of  (f,  of  which  the  pth  power  is  the  first  to  occur  in  H. 

Finally  an  extension  of  the  last  theorem  furnishes  the  following 
important  result: 

Theorem  XII.     //  the  series  of  groups 

(1,  G?i,  G-,,  Gs,  .  .  .  G„ 

is  so  connected  that  every  6ra_3  can  be  obtained  from  the  following 
Ga  by  the  addition  to  the  latter  of  a  substitution  ra  commutative 
with  Ga,  of  which  a  prime  power,  the  path,  is  the  first  to  occur  in  Ga, 
flic i'  and  only  then  it  is  possible  to  obtain  a  ;>  ■  }>]  ■  p, .  .  .  pv- valued 
function  belonging  to  Gv  from  a  p-valued function  belonging  to  G  by 
the  solution  of  a  series  of  binomial  equations.  The  latter  are  then 
of  degree    p1}p2,P3,  ■  ■  •/>>■-  respectively. 

8  111.  In  the  expression  of  a  given  function  in  terms  of 
another  belonging  to  the  same  family,  we  have  met  with  rational 
fractional  forms  the  denominators  of  which  were  factors  of  the  dis- 
criminant of  the  given  function.  If  we  regard  the  elements 
.«•,,  .<•,.  .  .  .  x„  as  independent  quantities,  as  we  have  thus  far  done, 
the  discriminant  of  auy  function  <p  is  different  from  zero,  for  the 
various  conjugate  values  of  <p  have  different  forms.  But  if  any 
relations  exist  among  the  elements  x,  it  is  no  longer  true  that  a  dif- 
ference in  form  necessarily  involves  a  difference  in  value.  It  is 
therefore  quite  possible  that  if  the  coefficients  in  the  equations 

f(x)  =  .i-"  — c,.*-"-1  +c,x"--—  ...±cn  =  0 

are  assigned  special  values,  the  discriminant 


126  THEORY    OF    SUBSTITUTIONS. 

J    =2J(cj,C2, . . .  c„) 

may  become  zero.  If  this  were  the  case,  c  could  not  be  employed 
in  the  expression  of  other  functions  of  the  same  family.  And  it  is 
conceivable  that  the  discriminant  of  every  function  of  a  family 
might  vanish.  It  is  therefore  necessary,  in  order  to  remove  this 
uncertainty,  to  prove 

Tiioorem  XIII.  If  only  no  two  x* 's  are  equal,  then  ivhatever 
other  relations  may  exist  among  the  x's,  there  are  in  ever//  fa  mily 
functions  the  discriminants  of  which  do  not  vanish. 

A  proof  might  be  given  similar  to  that  of  £  80.  It  is  however 
more  convenient  to  make  use  of  the  result  there  obtained,  that 
under  the  given  conditions  there  are  still  n!- valued  functions  of  the 

form 

c  —  a0  -f  ayvx  +  «.,.r,,  +  .  .  .  +  anxK . 

We  suppose  the  a' a  and  the  .r's  to  be  free  to  assume  imagin- 
ary (complex)  as  well  as  real  values.  This  being  the  case,  if  the 
n\  values  of  c  are  all  different,  we  can  select  the  coefficient  a0,  so 
that  the  moduli  of  the  values  of  <p  are  also  all  different.     For  if 


n  =  »'a  +  !>k  V  —  1       (/■  =  1,  2,  .  .  .  n  >. 
then  we  can  take 

"■'  =P  +  <1  >/--l 

in  such  a  way  that  all  the  >/ !  quantities 

**a  =  <Pk  +  «'='<  '"a  +  P)  +  (a»a  +  q)  V  =ri     (^  =  1,' 2,  . . .  n) 
shall  have  different  moduli.     For  from 

( "'a  + p r+  (/'a  +  qf  -  (w«  +  pf+  (,"K  +  q r 
it  would  follow,  if  j>  and  q  are  entirely  arbitrary,  that 

"'a  =mKi    !I-k  —  !>k- 

In  fact  we  can,  for  example,  take  p  =  q-  and  q  so  large  that  even 
special  values  of  q  satisfy  the  conditions. 

Suppose  then  that  the  cVs  are  arranged  in  order  of  the  magni- 
tudes of  their  moduli 

</•, ,  (,'• ,, ,  c';i ,  .  .  .  c\,:      (mod.  c'-a  >  mod.  4'\  +i) • 

"We  take  then  the  integer  e  so  great  that 

cV  >  (<h  ,  1,+<''a+«,+  •  •  •  +  M     (*  =  1,2, .. .  (nl— 1)). 


THE    NUMBEE    OF    VALUES    OP    INTEGRAL    FUNCTIONS.  127 

From  every  equation  of  the  form 

V  • )  if'a   +  to  +  <■:  +  •  •  •   =  4'a'  +  W  +  <'y    +  •  •  ■ 

it  follows  accordingly  that  a=  a,b  =  fi,  c  =  y, .  .  .  If  now  we  apply 
the  r  substitutions  of  6?  to  </•,',  and  add  the  results,  the  sum 

is  a  function  of  the  required  kind.  For  in  the  first  place  to  is  evi- 
dently unchanged  by  G.  And  in  the  second  place  the  properties  of 
the  equation  '/'")  show  that  «>  has  <>  distinct  values,  and  consequently 
-L  is  not  zero. 


CHAPTER  VI 


THE  NUMBEK  OF  VALUES  OF  INTEGRAL  FUNCTIONS. 

§  112.  Thus  far  we  have  obtained  only  ocasional  theorems  in 
regard  to  the  existence  of  classes  of  multiple-valued  functions.  We 
are  familiar  with  the  one-  and  two-valued  functions  on  the  one  side 
and  the  »!-valued  functions  on  the  other.  But  the  possible  classes 
lying  between  these  limits  have  not  as  yet  been  systematically  exam- 
ined. An  important  negative  result  was  obtained  in  Chapter  III, 
£  4:2,  where  it  was  shown  that  p  cannot  take  any  value  which  is  not 
a  divisor  of  n\.  Otherwise  no  general  theorems  are  as  yet  known 
to  us.  We  can,  however,  easily  obtain  a  great  number  of  special 
results  by  the  construction  of  intransitive  and  non- primitive  groups. 
But  these  are  all  positive,  while  it  is  the  negative  results,  those 
which  assert  the  non-existence  of  classes  of  functions,  that  are  pre- 
cisely of  the  greatest  interest. 

The  general  theory  of  the  construction  of  intransitive  groups 
would  require  as  we  have  seen  in  §  101,  a  systematic  study  of  iso- 
morphism in  its  broadest  sense.  We  shall  content  ourselves  there- 
fore with  noting  some  of  the  simplest  constructions. 

Thus,  if  there  are  n  =  a  -f-  b  -f-  c  +  .  .  .  elements  present,  and 
if  we  form  the  symmetric  or  the  alternating  group  of  a  of  them, 
the  symmetric  or  alternating  group  of  b  others,  and  so  on,  then  on 
multiplying  all  these  groups  together,  we  obtain  an  intransitive 
group  of  degree  n  and  of  order 

r  =  e  a!6!c!  .  .  ., 

where  e  =  l,  I-  \  ■  |i  ■  ■  ■  >  according  as  the  number  of  alternating 
groups  employed  in  the  construction  is  0,  1,  2,  3,  .  .  .  ,  the  rest  being 
all  symmetric.  For  the  number  of  values  of  the  corresponding 
functions  we  have  then 

n\ 
''  ~  *a\b\c\...' 


a  —  5; 

a  —  4, 

6  =  1; 

a  =  4, 

6=1; 

a  =  3, 

6  =  2; 

a  =  3, 

6  =  2; 

a  =  3, 

6  =  2; 

THE    NUMBER    OF    VALUES    OF    INTEGRAL    FUNCTIONS.  129 

By  distributing  n  in  different  ways  between  a,  6,  c,  . .  . ,  we  can 
obtain  a  large  number  of  classes  of  functions.  For  example,  if 
n  =  5,  we  may  take 

a  =  5 ;  -:  =  1,   ,"  =   1 ;   <pi  —  xxxtx-ixixy 

-r  =  h  p  =  '2;  ft  =  to  — ^to  -^affg)...to— #5) 

c  =  J.,     ^  ^=       0;      <p$  ==  >3?i J^2"^'3^'-'4* 

e  =  I,  p  =  10 ;    9r4  =  to  —  a?2)  to  —  «k)  to  _  ^ 

(_<^2 «^3/  '  *^2  "      ^4/  \P^3  ***4  /  • 

e  =  1,  />  =  10;    <f-,  =  xxx2xz  -\-  iC4a-3. 
e  =  i    ,,  =  20 ;    y6  =  (cc,  —  x,)  (.*•,  —  .r, )  (x,  —  a?8) 

-j-  a',.'1-,- 

e  =  4,  ,"  =  40;    crs  =  (a?,  —  as,)  (a;,  —  xz)(x,—  x3) 

\   a'l       t**'>  • 
a  =  3,  6  =  1,  c  =  1 ;  e  =  1,  ,»  =  20;    <f,,  =  8,fl^V 

The  imprimitive  groups  give  rise  in  a  similar  way  to  the  con- 
struction of  functions  with  certain  values.  For  example,  for  n  =  6, 
we  may  take  any  two  systems  of  non-primitivity  of  three  elements 
each,  or  any  three  systems  of  two  elements  each,  and  with  these 
construct  various  groups,  the  theory  of  which  depends  only  on  that 
of  groups  of  degrees  two  and  three. 

§  113.  General  and  fundamental  results  are  not  however  to  be 
obtained  in  this  way.  We  approach  the  problem  therefore  from  a 
different  side,  which  permits  us  to  give  it  a  new  form  of  statement. 

Given  a  /--valued  function  <?x  with  a  group  Gx ,  we  construct  again 
the  familiar  table  of  §  41 : 

f\'l  S\  — :  1>     S2J  Si1  •   •   •  Sr       '■)         Gx 

cr,;        ffif  S:'T2-    •S3'T?>  •  •  •  Sr<r2;      ^1*2 

<Pi\       *?,,         s2ff3,  S3T3,  . .  .s,.t3;     Gt(rz 


<fP;      Vp,         s2ffp,  Sjffp,  . . .  s,.«rp;     G}tp. 

We  proceed  then  to  examine  the  distribution  of  the  substitutions  of 
a  given  type  among  the  lines  of  this  table. 

A)     There  are   »  —  1  transpositions    (a;1a;a),  (a  =  2,  3, . .  .  >t).    If 
9 


130  THEORY    OF    SUBSTITUTIONS. 

then  p  <  u,  and  if  the  group  Gx  of  <pt  does  not  contain  any  trans- 
position of  the  form  (a",a*a),  these  (n — 1)  transpositions  are  distribu- 
ted among,  at  the  most,  (n —  2)  lines  of  the  table.  Accordingly  some 
line  after  the  first  must  contain  at  least  two  of  them.  Suppose  these 
two  are 

Then  it  appears  that  a  combination  of  the  two 
faXaXt)  =  (a?,a:„)  (.*■,.*•,)  =  s«ta(s0*a)-1  =  8affKffX~  l8p~ '  =  Sa8fi-1  =  sy 

occurs  in  G', .  Consequently,  if  //  <  n,  Gt  contains  either  a  transpo- 
sition or  a  circular  substitution  of  the  third  order,  including  in 
either  case  a  prescribed  element  a*, .  The  same  is  obviously  true  of 
any  prescribed  element  a*A. 

B)     There  are         0 — —  transpositions  of  the  form  (xaxp),  («=j=,S 


=  1,2,...  n).     If  therefore  />  <^  — — ~ — - ,  and  if  the  first  line  of  the 

table  does  not  contain  any  transposition,  then  some  other  line  con- 
tains at  least  two.  If  these  have  one  element  in  common,  as  (xaxp), 
(xaxy),  then,  as  we  have  seen  in  A),  their  product  (xaxpxy)  occurs  in 
6r, .  If  they  have  no  element  in  common,  as  (xaxp),  (xyx&),  then 
their  product  (xaXp)  (xyxs)  also  occurs  in  Gx .  In  either  case  (2, 
therefore  contains  a  substitution  of  not  more  than  four  elements. 

C)  There  are  (n — 1)  (n  —  2)  substitutions  of  the  form  (x&aXp), 
{a-f,3  =  2, 3, . . .  n).  If  therefore  /'  <  (n—  1)  (n  —  2),  and  if  Gx  con- 
tains no  substitution  of  this  form,  some  other  line  of  the  table  con- 
tains at  least  two  of  them.  A  combination  of  these  shows  that  Gx 
contains  substitutions  which  affect  three,  four,  or  five  elements. 

Proceeding  in  this  way,  we  obtain  a  series  of  results,  certain 
of  which  we  present  here  in  the  following 

Theorem  I.  1)  If  the  number  />  of  the  values  of  a  function 
is  not  greater  than  n — 1,  the  group  of  the  function  contains  a  sub- 
stitution of,  at  the  most,  three  elements,  including  anrj  prescribed 

Ttift 1  ) 

element.     2)     If  p   is  not  greater  than  — — ^ — -,  the  group  of  the 

function  contains  a  substitution  of,  at  the  most,  four  elements.     3) 

n(n — l)(n — 2) 
If  p  is  „of  greater  than  — ^ ,  the  group  of  the  function 


THE    NUMBER    OF    VALUES    OF    INTEGRAL    FUNCTIONS.  131 

contains  a  substitution  of,  at  the  most,  six  elements.     4)  If  p  is  not 

.     ..      n(n— 1)(»— 2)...(w— fc  +  1)    ,,  -..     . 

greater  than  — — i -,  the  group  of  the  func- 

tion  contains  a  substitution  of,  at  the  most,  2k  elements.  5)  If  p  is 
not  greater  than  (n  —  1)  (w — 2)  .  .  .  (n — k-\-l),  the  group  of  the 
function  contains  a  substitution  of,  at  the  most,  2k  —  1  elements, 
including  any  prescribed  element,  so  that  the  group  contains  at  least 
n 


2k— 1 


such  substitutions. 


By  the  aid  of  these  results  the  question  of  the  number  of  values 
of  functions  is  reduced  to  that  of  the  existence  of  groups  contain- 
ing substitutions  with  a  certain  minimum  number  of  elements. 

§  114.  In  combination  with  earlier  theorems,  the  first  of  the 
results  above  leads  to  an  important  conclusion. 

From  Chapter  IV,  Theorem  I,  we  know  that  the  order  of  an 
intransitive  group  is  at  the  most  (n  —  1)!.  Consequently,  the  num- 
ber of  values  of  a  function  with  an  intransitive  group  is  at  least 

n ' 

-. '-zrr  =  n.   For  such  a  function  therefore  p  cannot  be  less  than  n. 

(n — 1)! 

Again,  the  order  of  a  non-primitive  group  is,  at  the  most,  2!  I  — !  I  , 

so  that  the  number  of  values  of  a  function  with   a  non-primitive 

n\ 

group  is  at  least .     For  n  =  4,  this  number  is  less  than  n; 

*•  2  '  2 

but  for  n  >  4,  -it  is  greater  than  n.     For  such  a  function  then,  if 

n  >  4,  />  cannot  be  less  than  n.  Again  for  the  primitive  groups  it 
follows  from  Chapter  IV,  Theorem  XVIII,  in  combination  with  the 
first  result  of  Theorem  I,  §  113,  that  if  p  <  n,  the  corresponding 
group  is  either  alternating  or  symmetric,  that  is,  p  =  2  or  1.  The 
non-primitive  group  for  which  n  =  4,  p  =  4,  r  =  8  is  already  known 
to  us,  (§  46).     We  have  then 

Theorem  II.  If  the  number  p  of  the  values  of  a  functioii  is 
less  than  n,  then  either  p  =  1  or  p  =  2,  and  the  group  of  the  func- 
tion is  either  symmetric  or  alternating.  An  exception  occurs  only 
for  n  =  4,  p  =  3,  r  =  8,  the  corresponding  group  being  that  belong- 
ing to    XxX.,-\-  X-zXi. 


132  THEORY    OF    SUBSTITUTIONS. 

£  115.     On  account  of  the  importance  of  the  last  theorem  we 
add  another  proof  based  on  different  grounds.  * 
Suppose  <f  to  be  a  function  with  the  p  <  ti  values 

9u  <Pu  <P»i  ■  •  •  9P- 
If  we  apply  any  substitution  whatever  to  this  series,  the  effect  will 
be  simply  to  interchange  the  p  values  among  themselves.     If  in 
particular  the  substitutions  applied  belong  to  the  group  6r,  of  y, , 
then  the  p  values  will  be  so  interchanged  that  cr,  retains  its  place. 

n! 
All  the  r  =  -  -  >  (n  —  1) !  substitutions  of  G}  therefore  rearrange  only 

the  p  —  1  values  <pu  cr,,  .  . .  <pp.  Since  p  <  n,  there  are  at  the  most, 
only  (jo  —  1 ) !  <  (n  —  2 ) !  such  rearrangements.  Consequently  among 
the  r  >  (n  —  1 ) !  substitutions  of  Gx  there  must  be  at  least  two,  a  and 
r,  which  produce  the  same  rearrangement  of  cr.,,  $p3,  . .  .  <pp.  Then 
ffr~ '  is  a  substitution  different  from  identity,  which  leaves  all  the 
y's  unchanged,  that  is,  which  occurs  in  all  the  conjugate  groups 
£?!,  (jt2,  .  .  .  Gp.  But  if  »  >  4  there  is  no  such  substitution  (Chapter 
III.  Theorem  XIII).     Consequently  p  >  a. 

§  1 16.  Passing  to  the  more  general  question  of  the  determina- 
tion of  all  functions  whose  number  of  values  does  not  exceed  a  given 
limit  dependent  on  n,  we  can  dispose  once  for  all  of  the  less  impor- 
tant cases  of  the  intransitive  and  the  non  primitive  groups.  For 
the  purpose  we  have  only  to  employ  the  results  already  obtained  in 
Chapter  IV. 

In  the  case  of  intransitive  groups  we  have  found  for  the  maxi- 
mum orders: 

1)  r=(n      1)!.     Symmetric  group  of  n  —  1  elements.     /'  =  //. 

(n — 1  >! 

2)  r  =  .      Alternating  group  of  //       1  elements.     />  =  2  n. 

3)  /■  =  2\(n  —  2)!.    Combination  of  the  symmetric  group  of  n  —  2 

n(n  —  1) 
elements  with  that  of  the  two  remaining  elements,     p  =  -      9        . 

4)  r  —  (n  2)!.  Either  the  combination  of  the  alternating  group 
of  n  —  2  elements  with  the  symmetric  group  of  the  two  remaining 
elements;  or  the  symmetric  group  of  n  2  elements,  In  both  cases 
/,  =  n(»  — 1).     Etc. 

*  L.  Kronecker:  Monatsber.  <l.  Berl.  Akud..  I88f>.  p. 211. 


THE    NUMBER    OF    VALUES    OF    INTEGRAL    FUNCTIONS.  133 

For  the  non- primitive  groups  we  have 

1)  ?*  =  2!l  -~-!  I  .     Two  systems  of  non-primitivity  containing  each 

a 

jj  elements.     The  group  is  a  combination  of  the  symmetric  groups 

of  both  systems  with  the  two  substitutions  of  the  systems  them- 

?i ! 
selves,     p  =  -  -  .    For  n  =  4,  6, 8,  .  .  .  we  have  i>  =  3,  10,  35,  .  . . 

•(f)" 

2)  r  =  3 !  I  -Q- !  I .     Three  systems  of  non-primitivity.     The  group 
is  a  combination  of  the  symmetric  groups  of  the  three  systems  with 

the  3 !  substitutions  of  the  svstems  themselves,     p  = — - — .    For 

8l(-lY 

n  =  6,  9, 12,  ...  we  have  p  =  15,  280,  5770,  ...  137 

3)  r  =  3 1  -=-!  I  .     As  in  2),  except  that  only  the  alternating  group 

of  the  three  systems  is  employed,  p  =  — — —  '  For  n  =  6, 9, 12,. . . 
we  have  P  =  30,  560, 11540,  ..  .  3V3~!J 

The  values  of  p  increase,  as  is  seen,  with  great  rapidity. 

§  117.  In  extension  of  the  results  of  §  113  we  proceed  now  to 
examine  the  primitive  groups  which  contain  substitutions  of  four, 
but  none  of  two  or  of  three  elements. 

Such  a  group  G  must  contain  substitutions  of  one  of  the  two 
types 

The  presence  of  s2  requires  that  of  s.22  =  (xaxc)  (xbxd),  which  belongs 
to  the  former  type.  Disregarding  the  particular  order  in  which  the 
elements  are  numbered,  we  may  therefore  assume  that  the  substitu- 
tion 

occurs  in  the  group  G. 

We  transform  s5  with  respect  to  all  the  substitutions  of  G  and 
obtain  in  this  way  a  series  of  substitutions  of  the  same  type  which 
connect  xl ,  x2 ,  xs ,  a-4  with  all  the  remaining  elements  (Chapter  IV, 
Theorem   XIX).     The   group    G   therefore   includes   substitutions 


134  THEORY    OF    SUBSTITUTIONS. 

similar   to   s5   which   contain    besides   some  of   the   old   elements 
.c, .  .rt  other  new  elements  o?6,  xt, .»;,  .  .  . 

This  can  happen  in  three  different  ways,  according  as  one,  two, 
or  three  of  the  old  elements  are  retained.  Noting  again  that  it  is 
only  the  nature  of  the  connection  of  the  old  elements  with  the  new, 
not  the  order  of  designation  of  the  elements  that  is  of  importance, 
we  recognize  that  there  are  only  five  typical  cases : 

\X\Xl)  \X%Xh),       Kp^V^z)  V^2^i)i 

(XiX5)  (X2X6),         (^l-^s)  \X3X6)j 

\X\X5)  [X&Xi). 

In  the  first  case,  for  example,  it  is  indifferent  whether  we  take 

{XyXo)  (X^^j,    yX^X.))  {XiX^})    (X^X^  {XyX^J,    [X^X})  \X2X5) ', 

and  in  the  last  we  may  replace  a^  by  x2,  x3,  or  xt,  etc. 

The  first  and  fifth  cases  are  to  be  rejected,  since  their  presence 
is  at  once  found  to  be  inconsistent  with  the  assumed  character  of 
the  group.     Thus  we  have 

\X\X2j  \X3Xi)  •  \X^X2j  [X^X^J       —  \X2,XiX^fi 
\\X1X2)  {X^X^  •  (XiX5)  {X6Xi)  J    =  {XlX5X2), 

the  resulting  substitutions  in  each  case  being  inadmissible. 

There  remain  therefore  only  three  cases  to  be  examined,  accord- 
ing as  G  contains,  beside  s, ,  one  or  the  other  of  the  substitutions 

JL)  yX^Xz)  (X2X5)) 

B)  {x,x^  (x2x6), 

the  first  case  involving  one  new  element,  the  last  two  cases  two 
new  elements  each. 

§  118.     A)     The   primitive  group  G  contains  the  substitutions 

n-  =  yxiX2)  {X^X^),       S4  =  (X^s)  (X2;l':, ). 

and  consequently  also 

t  ^  S5S4  ==  \XiX5X2Xsxi),     Sj  ^  taj       —  yx2x$)  yp^i'^a)' 

Since  t  is  a  circular  substitution  of  prime  order  5,  it  follows  from 
§  83,  Corollary  I,  that  if  n^l,  is  at  least  three-fold  transitive. 
Then  G  must  contain  a  substitution  u,  which  does  not  affect  xt  but 


THE    NUMBER    OF    VALUES    OF    INTEGRAL    FUNCTIONS.  135 

replaces  ar,  by  x6  and  x3  by  x1 .  If  we  transform  sr,  with  respect  to 
this  substitution,  we  obtain 

s'  =  u~\u  =  (x^)  (x1xa). 

If  x„  is  contained  among  j»2,aj8,aJ4,  oj5,  then  .s'  and  8,  have  only 
one  element  in  common  and  if  xa  is  contained  among  x$,x9,... 
then  s'  and  s5  have  only  one  element  in  common.  Both  alternatives 
therefore  lead  to  the  rejected  fifth  case  of  the  preceding  Section. 

If  n>_l,  G  becomes  either  the  alternating  or  the  symmetric 
group.      There  is  in  this  case  no  group  of  the  required  kind. 

For  n  =  4  it  is  readily  seen  that  there  are  two  types  of  groups 
with  substitutions  of  not  less  than  four  elements,  both  of  which  are 
however  non-  primitive. 

Groups  of  the  type  A)  therefore  occur  only  for  n  —  5  or  n  —  6. 

For  n  =  5  we  have  first  the  group  of  order  10, 

If  we  add  to  G1  the  substitution  a  =  (x^x^),  we  obtain  a  second 
group  of  order  20 

The  latter  group  is  that  given  on  p.  39.  6r,  and  Gr2  exhaust  all  the 
types  for  n  =  5. 

For  B  =  6we  obtain  a  group  Gt  of  the  required  type  by  adding, 
to  G2  the  substitution  (x^)  (x2x3).  Since  Gx  is  of  order  10,  the 
transitive  group  6r4  must  be  at  least  of  order  60  (Theorem  II, 
Chapter  IV).  And  again,  since  {xxx^}  (x2x3)<t  =  t  =  (x^x^x^x-^, 
we  may  write  6?4  =  \t,  t,  t\.     We  find  then  that 

rt  =  <rV,     7<T  =  f<rz\ 
Consequently  from  §  37,  it  follows  [that   Gt  is  of  order  120. 

The  60  substitutions  of  GA  which  belong  to  the  alternating  group 
from  another  group  of  the  required  type 

G3=\G1,  (xlx6)(x2x3)\. 

§  119.     B)     In  this  case  G  contains 

s5  =  {xxx2)  (x3x4)     t  =  (a-ja's)  (x2x6), 

and  consequently  the  combination 


136  THEORY    OF     SUBSTITUTIONS. 

•  r  =  Sra - 'rs5  =  (a?xa>6)  (x,»:i ). 

These  three  substitutions  are  not  sufficient  to  connect  the  six  ele- 
ments .«•, ,  x2 ,  .  .  .  x0  transitively,  there  being  no  connection  between 
x3,  x4  and  .»•,,  .»•_,,  .«•-,,.«•,,.  The  group  must  therefore  (§  83)  contain 
another  substitution  of  the  type  (xaxp)  (xyx&)  which  connects 
Xiix2,x6,xi  with  other  elements.  If  this  substitution  should  con- 
tain three  of  the  elements  ,r, ,  x., ,  «5 ,  x6  and  only  one  new  one,  it 
would  have  three  elements  in  common  with  v.  This  would  lead 
either  to  to  the  type  A)  or  to  the  rejected  first  case  of  §  117.  If 
the  new  substitutions  contained  only  one  of  the  new  elements 
a?i,  x3,  xb,  a?B  and  three  new  ones,  then  we  should  have  the  fifth  case 
of  §  117,  and  this  is  also  to  be  rejected. 

There  remains  only  the  case  where  the  new  substitution  connects 
two  of  the  elements  ,r,,  x2,  x5,  xt,  with  two  others.  It  must  then  be 
of  one  of  the  forms 

\X\Xa)  [X2Xi,),         y^'v^a)   [p^V^bJl        [P^V^a)  V^V^fijj 

\x2xa)  [xsXf,)f     {x2x„)  {x^X/,),     (xr,xri)  {x6Xi,). 

Of  these  the  first,  third,  fourth  and  sixth  stand  in  the  relation 
defined  by  C)  to  r,  while  the  first,  second,  fifth  and  sixth  stand  in 
the  same  relation  to  v. 

All  the  groups  B)  therefore  occur  under  either  A)  or  C),  and 
we  may  pass  at  once  to  the  last  case. 

§  120.     C).     In  this  case  the  required  group  contains 

tf-j  =  (xxX.2)  fax^)      <7.2  =  fax5)  fax6),       <73  =  *{■  lT.2ff1  =  (x2x5)  (xtx6). 

We  consider  first  the  case  n  =  6. 

The  elements  xl,x2,x-1  are  not  yet  connected  with  x3,xAix6. 
There  must  be  a  connecting  substitution  in  the  group  of  the  type 
(xaxp)  (xyx&),  where  we  may  assume  that  xa  is  contained  among  the 
the  three  elements  xu  x2,xb.  If  xa  were  x2  or  x61  then  we  should 
obtain,  by  transformation  with  respect  to  t,  or  <r2,  a  substitution 
faxb)  (xcxu),  so  that  we  may  assume  a  =  1.  The  possible  cases  are 
then 

(a)      fax2)faxm),       faxb)  (x2Xm),      faxb)fax,„)  1)1  =  3,  4,  6. 

(P)     (XiXm)  (xnxp),  m,  n,  p  =  3,  4,  6. 

(r)     fax,,,)  (x,xn),     fax„,)fax,).  m,n  =  2, 4, 6. 


THE    NUMBER    OF    VALUES    OF    INTEGRAL    FUNCTIONS.  137 

The  substitutions  of  the  first  and  second  lines  are  to  be  rejected, 
since  their  products  with  au  <r2,  <r9  lead  to  the  first  case  in  §  117,  or 
directly  to  substitutions  wtth  only  three  elements.  There  remain, 
for  the  different  values  of  m  and  n,  only  the  following  cases: 

[XyX^j  {X^Xq),        y^v^&)  \p^2^3)) 

\pC\Xi)  yXitX^j,     [XiX6)  [x.iXij, 

\XiXz)  {x5x6),     (XiXfjj  yx5x3)j 
{x^Xi)  {x5x6),     yXiX6)  [x-x^). 

The  second  and  fourth  lines  and  the  third  and  sixth  must  be  rejected, 
since  their  substitutions  have  three  elements  in  common,  the  former 
with  <ix ,  the  latter  with  <r9.  The  first  line  stands  in  the  same  relation 
to  t,  as  the  fifth  to  &.,.  We  need  therefore  consider  only  the  first 
line.  The  product  of  either  of  its  substitutions  by  <x,  gives  the 
other.     The  required  group  therefore  contains  beside  ff, ,  <r, ,  <r3  also 

The  group  generated  by  these  four  substitutions 

G'  —  \<tu  ff2,  ffg,  <r4\  =  \au  ffa,  «7t| 

is  of  order  24.  It  is  non-primitive,  the  systems  of  non-primitivity 
being  xl,x3;  x2,xt;  and  xb ,  x6 .  It  can  also  be  readily  shown 
that  there  is  no  primitive  group  G5  of  the  required  type  which  con- 
tains G'. 

For  n  =  6  there  are  only  two  groups  of  the  required  type.  These 
are  the  groups  G3   (r  =  60)  and  G<  (r  =  120)  of  §  118. 

§  121.  If  the  degree  of  the  required  group  is  greater  than  6, 
the  indices  m,  n,  p  of  the  lines  «),  /?),  r)  in  the  preceding  Section 
have  a  correspondingly  larger  range  of  values.  It  is  again  readily 
seen,  however,  that  the  three  cases  a)  are  inadmissible.  But  (,3) 
(y)  both  give  rise  to  groups  which  satisfy  the  required  conditions. 
The  actual  calculation  shows  that  in  every  case  a  proper  combina- 
tion of  the  resulting  substitutions  gives  a  circular  substitution  of 
seven  elements.  Consequently  the  group  G  is  at  least  (n —  6) -fold 
transitive  (§  83). 


138  THEORY    OF    SUBSTITUTIONS. 

If  then  «2l9,  G  is  at  least  three-fold  transitive,  and  therefore 
contains  a  substitution  which  does  not  affect  .r, ,  but  interchanges  x2 
and  £g.  If  we  transform  t,  with  respect  to  this  substitution,  we 
obtain 

<>    —  \XiX3)  \X2Xa), 

and  since  ax  has  three  elements  in  common  with  <r,  either  we  have 
the  case  .4),  or  xa  =  xt  and  <r,  is  equal  to  the  t4  of  the  preceding 
Section. 

In  the  latter  case  the  subgroup  which  affects  xlix2,...Xi  is 
itself  at  least  simply  transitive'  Combining  with  this  group  the  cir- 
cular substitution  of  seven  elements  we  obtain  a  two-fold  transitive 
group.  Consequently  (§84)  G  is  at  least  (n — 5)-fold,  and  for 
n>_9,  at  least  4-fold  transitive.  G  contains  therefore  the  sub- 
stitutions 

T  =  (CCj)  {X2X3)  (a?4#*5 .  .  . ) , 

r     tfjT  =.  (X]a"3)  (x2x5), 

so  that  we  return  in  every  case  to  the  type  A).  For  n  >$  there  is 
therefore  no  group  of  the  required  type. 

Theorem  III.  //  the  degree  of  a  group,  which  contains 
substitutions  of  four,  but  none  of  three  or  of  two  elements,  exceeds 
8,  the  group  is  either  intransitive  or  non-primitive. 

Combining  this  result  with  those  of  §  113  and  §  116,  we  have 

Theorem  IV.  If  the  number  p  of  the  values  of  a  function 
is  not  greater  than  %n(n  —  1),  then  if  n  >  8,  either  1)  p  =  %n(n  —  1), 
and  the  function  is  symmetric  in  n  —  2  elements  on  the  one  hand 
and  in  the  two  remaining  elements  on  the  other,  or  2)  f  =  2n,  and 
the  function  is  alternating  in  n  —  1  elements,  or  3)  p  =  n,  and 
the  function  is  symmetric  in  n  —  1  elements,  or  4)  p  =  1  or  2,  and  the 
function  is  symmetric  or  alternating  in  all  the  n  elements* 

§  122.  We  insert  here  a  lemma  which  we  shall  need  in  the 
proof  of  a  more  general  theorem,  f 

From  §  83,  Corollary  II,  a  primitive  group,  which  does  not 
include  the  alternating  group,  cannot  contain  a  circular  substitution 

*Cauchy:Journ.  rte  PEcole  Polytech.  X  Cahier;  Bertrand:  Ibid.  XXX  Cahier;  Abel: 
Oeuvres  completes  I,  pp.  13-21;  J.  A.  Serret:  Journ.  del'Ecole  Polytecb.  XXXII  Cahier; 
C.Jordan:  Traiteetc,  pp.  07-75. 

tC.  Jordan:  Traite  etc.. p. 664.    Note  C. 


THE    NUMBER    OF    VALUES    OF    INTEGRAL    FUNCTIONS.  139 

2n 
of  a  prime  degree  less  than  ■=- .     If   p    is  any  prime  number  less 

In 
than  -=- ,  and  if  p ■'  is  the  highest  power  of  p  which  is  contained  in 
o 

n ! ,  then  the  order  of  a  primitive  group  G  is  not  divisible  by  pf. 
For  otherwise  G  would  contain  a  subgroup  which  would  be  similar 
to  the  group  K  of  degree  n  and  order  pf  (§  39).  But  the  latter 
group  by  construction  contains  a  circular  substitution  of  degree  p, 

and  the  same  must  therefore  be  true  of  G.     Consequently  p  =  — 

must  contain  the  factor  p  at  least  once. 

What  has  been  proven  for  p  is  true  of  any  prime  number  less 

than  -=-  and  consequently  for  their  product.     We  have  then 
o 

Theorem  V.  If  the  group  of  a  function  ivith  more  than 
tivo  values  is  primitive,  the  number  of  values  of  the  function  is  a 
multiple  of  the  product  of  all  the  prime  numbers  ivhich  are  less 

than  -K-. 
o 

§  123.     By  the  aid  of  this  result  we  can  prove  the  following 

Theorem  VI.  If  k  is  any  constant  number,  a  function  of 
n  elements  ivhich  is  symmetric  or  alternating  with  respect  to  n  —  k 
of  them  has  fewer  values  than  those  functions  which  have  not  this 
property.  For  small  values  of  n  exceptions  occur,  but  if  n  exceeds 
a  certain  limit  dependent  on  k,  the  theorem  is  rigidly  true.* 

If  <p  is  an  alternating  function  with  respect  to  n — k  elements, 
the  order  of  the  corresponding  group  is  a  multiple  of  h(n  —  fc)!,  and 
the  number  of  values  of  the  function  is  therefore  at  the  most 

A)  2  n(n  —  1)  (n  -  2) . . .  (n  —  k  + 1). 

If  <p  is  a  function  which  is  neither  symmetric  nor  alternating  in 
n — k  elements,  it  may  be  transitive  with  respect  to  n — k  or  more 
elements.  But  in  the  last  case  c''  must  not  be  symmetric  or  alterna- 
ting in  the  transitively  connected  elements. 

We  proceed  to  determine  for  both  cases  a  minimum  number  of 

•C.  Jordan:  Traits  etc.,  p.  67. 


141 1  THEORY    OF    SUBSTITUTIONS. 

values  of  </•,  and  to  show  that  if  //    is  sufficiently  large,  this  mini 
mum  is  greater  than  the  maximum  number  of  values  A)  of  <p. 

§  124.     Suppose  at  first  that  <.'■  is  transitive  in  less  than  n —  k 
elements.     Then  the  order  of  the  corresponding  group  is  a  divisor 

of 

/, !  /J  A8l . . .  where  /,  +  /2  +  A8-J-  . . .  =  n     (/a  <  n — k). 

This  product  is  a  maximum  when  one  of  the  A's  is  as  large  as  pos- 
sible, i.  e.,  equal  to  n  —  k —  1,  and  a  second  X  is  then  also  as  large 
as  possible,  i.  e.,  equal  to  k-\-\.  It  is  further  necessary  that 
k-\-  1  >  n  —  k  i.  e.,  n>  2&  +  1.  The  maximum  order  of  the  group 
is  consequently 

(»— k— 1)!  (fc  +  ll, 

and  the  minimum  number  of  values  of  4>  is 

n\  _n(n  —  1)  (n  —  2)  .  .  .  (n  —  k) 

(n—k—iy.  (A;  +  l!)_  1-2-3.  .  ..(&+1)        \ 

It  appears  at  once  that  the  minimum  B)  exceeds  the  maximum  A), 
as  soon  as 

»>fc  +  2(fc+l)! 

This  is  therefore  the  limit  above  which,  in  the  first  case,  the  theo- 
orem  admits  of  no  exception. 

§  125.  In  the  second  case  4>  is  transitive  in  n  —  /.  elements 
(x>_k),  but  it  is  neither  alternating  nor  symmetric  in  these  ele- 
ments. The  group  G  of  </'  is  intransitive,  and  its  substitutions 
are  therefore  products  each  of  two  others,  of  which  the  one  set 
01,0a,  .  . .  connect  transitively  only  the  elements  .*•,,  xa,  ...  &*—*, 
while  the  other  set  rt ,  r8 , '.  . .    connect  only  the  remaining  elements 

The  substitutions  of  the  group  (J  of  4'  have,  then,  the  product 
forms 

fflTl  >     ff2T2>     ff3r8>   •   •  •   ffa~a,  •  •  ■  ^Pi   •   ■  • 

where,  however,  one  and  the  same  <r  may  occur  in  combination  with 
different  r's.  It  is  easily  seen  that  all  the  ^'s  occur  the  same  num- 
ber of  times,  so  that  the  order  of  the  group  6  is  a  multiple  of  that 
of  the  group  2  =  [ffx ,  0a , . . .  ]. 

We  will  show  that  2  is  neither  alternating  nor  symmetric;  oth- 


THE    NUMBER    OF    VALUES    OF    INTEGRAL    FUNCTIONS.  141 

erwise  G  would  be  alternating  or  symmetric  in  n  —  x  elements, 
which  is  contrary  to  assumption.  If  the  group  2  were  alternating, 
it  would  be  of  order  h(n — x)\.  This  exceeds  the  maximum  num- 
ber y\  of  the  order  of  the  group  T  =  [rn  -,,...  J  of  *  elements, 
as  soon  as  n  >  '2A\  Consequently  G  contains  substitutions  "V^? 
ffprp,  in  which  -a  —  ~p  but  <ra  -|=^,  and  therefore  substitutions 
(TaTa  (ff/sTp)- '  =  *o.a$  '  which  affect  only  the  elements  .r, ,  x2 ,  .  .  ,xn_K 
of  the  first  set.  The  entire  complex  of  these  substitutions  forms  a 
self-conjugate  subgroup  H  of  G.  This  subgroup  is  unchanged  by 
transformation  with  respect  to  either  G  or  2,  since  ra,  Tp,  . . .  have 
no  effect  whatever  on  the  substitutions  of  H.  H  is  therefore  a  self - 
conjugate  subgroup  of  the  alternating  group  2 ,  and  must  accord- 
ingly coincide  with  2£  (§  92).  if  =  2  is  therefore  a  subgroup  of  G, 
and  c''  would,  contrary  to  assumption,  be  alternating  in  n —  x  ele- 
ments. 

§  126.  The  maximum  order  of  the  group  G  is  therefore  equal 
to  the  product  of  *!  by  the  maximum  order  of  a  non- alternating 
transitive  group  of  n  —  x  elements.  We  denote  the  latter  order 
by  R(n — x).     Then  the  minimum  number  of  values  of  </>  is 

n\  _    (n  —  x)\    n(n  —  1)  . . .  (n — *-f-l) 

ldR(n  —  x)~  R(n  —  x)'  ~TT 

We  have  now  still  to  determine  R(n —  x),  the  maximum  order  of 

(n — z)! 
a  non- alternating  transitive  group  of  » — x  elements,  or  -— —  —  , 

the  minimum  number  of  values  of  a  non-alternating  transitive 
function  of  n —  /.  elements. 

If  this  function  is  non-primitive  in  the  n —  *  elements,  it  follows 
that  the  minimum  number  of  values  is 

n.  /  M  (n— *)(n— *— l)...(^P"+l) 

C,)  (n —  x)\  _     v  V     Z  J 

2  j  [i(n— «)]!J»  ~  a  "  "[T^7*)] ! 

Substituting  this  value  in  C)  we  obtain  for  the  minimum  number  of 
values  of  4' 

n(n—  1 )...(/<  —  /+  1)(>/—  x)  ...  (^=-^-+1  ) 
C  )  i ■ 


142 


THEORY    OF    SUBSTITUTIONS. 


We  compare  this  number  with  the  maximum  number  A)  and 
examine  whether,  above  a  certain  limit  for  n,  C\)  becomes  greater 
than  A),  i.  e.,  whether 

n(n-l)...(»-*  +  l)(n-x)...(^+l) 

>4*!  ^-^\  n(n—  1).  .  .(n  —  x  +  1). 

For  sufficiently  large  n  we  have  I  — ~ |-  1  I  <  n — k-\-\.  We  have 

therefore  to  prove  that 

(n-k)(n-k-l)...(p^+l) 


>4z!— -— ! 


This  is  shown  at  once,  if  we  write  the  right  hand  member  in  the 
form 

For  the  first  factor  is  constant  as  n  increases,  and  the  ratio  of  the 
left  hand  member  to  the  second  parenthesis  has  for  its  limit 

n-\-K 

2-"—*. 

§  127.  Finally,  if  the  function  4'  of  the  n — x  elements  is  prim- 
itive, we  recur  to  the  lemma  of  §  122.  From  this  it  follows  that 
the  minimum  number  of  values  of  </'  is  the  product  of  all  the  prime 
numbers  less  than  §  (n—x).     We  will  denote  this  product  by 

Introducing  it  in  C),  we  have 
C2) 


|"2(»— x)~|  n(n— l)...(n— x  +  1) 


3 

We  have  then  to  show  that,  for  sufficiently  large  values  of  n,  the 
value  A)  is  less  than  C2),  i.  e.,  that 

p|-2(n— /)j  >  2xl(n_z)  (w__x_1}        (n—jb  +  l). 

The  right  hand  member  of  this  inequality  will  be  greatly  increased 
if  we  replace  every  n  —  /■  —  a  by  the  first  factor  n — *.  There  are 
k  —  /■  factors  of  the  form   n  —  *  —  o.     These  will  be  replaced  by 


THE    NUMBER    OF    VALUES    OF    INTEGRAL    FUNCTIONS.  143 

(n — x)k~K.     If  we  write  then  v  = ^ — -,  we  have  only  to  prove 

that  for  sufficiently  large  v, 

P(")>[2(|)*-^!]^-«, 
or 

P(y) 


„*-« 


>[  2  (*)*-«*!]. 


This  can  be  shown  inductively  by  actual  calculation,  or  by  the 
employment  of  the  theorem  of  Tchebichef,  that  if  v  >  3,  there  is 
always  a  prime  number  betiveen  v  and  2  v  —  2. 

For  we  have  from  this  theorem 

P(2v)>vP(v), 

(v)*-«  =  2*-*»/fc-« 

P(2v)    >  P(v)        V 


(2^)*-*       «*-«  2A'-«' 

Now  whatever  value  the  first  quotient  on  the  right  may  have,  we 
can  always  take  t  so  great  that  the  left  hand  member  of 

P(2',)  ^  P(v) 


(2V)*-«> 


PW  /^V 
>*-«  V.2k-KJ 


increases  without  limit,  if  only  v  is  taken  greater  than  2k'~K.     The 
proof  of  the  theorem  is  now  complete. 

The  limits  here  obtained  are  obviously  far  too  high.  In  every 
special  case  it  is  possible  to  diminish  them.  As  we  have,  however, 
already  treated  the  special  cases  as  far  as  p  =  %n(n  —  1),  it  does  not 
seem  necessary,  from  the  present  point  of  view,  J;o  carry  these  inves- 
tigations further. 


CHAPTER  VII. 


CERTAIN  SPECIAL  CLASSES  OF  GROUPS. 

£  1 28.  We  recur  now  to  the  results  obtained  in  §  48,  and 
deduce  from  these  certain  further  important  conclusions.* 

Suppose  that  a  group  G  is  of  order  r  =pam,  where  p  is  a  prime 
number  and  m  is  prime  to  p.  We  have  seen  that  G  contains  a  sub- 
group H  of  order  pa .  Let  J  be  the  greatest  subgroup  of  G  which 
is  commutative  with  H.  J  contains  H,  and  the  order  of  J  is  there- 
fore pai,  where  i  is  a  divisor  of  m  and  is  consequently  prime  to  p. 

Excepting  the  substitutions  of  H,  J  contains  no  substitution  of 
an  order  p$.  For  if  such  a  substitution  were  present,  its  powers 
would  form  a  group  L  of  order  pP.  But  if  in  A)  of  §  48  we  take 
for  Gr, ,  H1 ,  .ST]  the  present  groups  J,  L,  K,  then  since  <ry  '  Hny  =  H, 
we  should  have 

pai  _  pP      p? 

~p~^  "  d,       <£  +  '  '  ' 

The  left  member  of  this  equation  is  not  divisible  by  p.  Conse- 
quently we  must  have  in  at  least  one  case  dy  =  p&,  that  is,  L  is  con- 
tained in  vy~  lH<ry  =  H. 

Again,  every  subgroup  M  of  order  pa  which  occurs  in  G  is 
obtained  by  transformation  of  H.  For  if  we  replace  6r, ,  i/, ,  Kt  of 
A )  §  48  by  G,  H,  M,  we  obtain 

pH  _  pa      pa 

l>n=    '/,        '/,        ""' 
and  for  the  same  reason  as  before  dy  —  pa  in  at  least  one  case,  and 
therefore  M  —  uy    xH<ty .    Since  H,  as  a  self -conjugate  subgroup  of  J, 
is  transformed  into  itself  by  the  2>ai  substitutions  of  J,  it  follows  that 
there  are  always  exactly  pH  substitutions  of  G  which  transform  H 

KYI 

into  any  one  of  its  conjugates.     There  are  therefore  —  of  the  latter. 
*L.8ylow:  Math.  Ann.  V.  684-94. 


CERTAIN    SPECIAL    CLASSES    OF    GROUPS.  145 

Finally,  if  we  replace  G,  Hx ,  Kx  of  A)  §  48  by  G,  J,  H,  we 
have 

/■    _  pam  _  pai     p°-i 

Since  if,  is  contained  in  J, ,  we  must  have  d,  =  pa,  and  since  J  con- 
tains no  other  substitutions  of  order  p&,  no  other  d  can  be  equal  to 
pa.     It  follows  that 

r  =  pai  (kp  -j-  1),     m  =  i(kp  -\-  1) . 

The  group  H  has  therefore  kp  -{- 1  conjugates  with  respect  to  G. 
We  have  then  the  following 

Theorem   I.     If  the  order  r  of  a  group  G  is  divisible   by  pa 

but  by  no  higher  power  of  the  prime  number  p,  and  if  H  is  one  of 

the  subgroups  of  order  pa  contained  in  G,  and  J  of  order  pH  the 

largest  subgroup  of  G  which  is  commutative  icith  H,  then  the  order 

of  G  is 

r=pH(kp-{-l). 

Every  subgroup  of  order  pa  contained  in  G  is  conjugate  to  H.  Of 
these  conjugate  groups  there  are  kp  -\- 1,  and  every  one  of  them 
can  be  obtained  from  H  by  pH  different  transformations. 

§  1*29.  In  the  discussion  of  isomorphism  we  have  met  with  tran- 
sitive groups  whose  degree  and  order  are  equal.  In  the  following 
Sections  we  shall  designate  such  groups  as  the  groups  i-\ 

If  we  regard  all  simply  isomorphic  transitive  groups,  for  which 
therefore  the  orders  r  are  all  equal,  as  forming  a  class,  then  every 
such  class  contains  one  and  only  one  type  of  a  group  i-'  (§  98).  The 
construction  of  all  the  groups  ii  of  degree  and  order  /•  therefore 
furnishes  representatives  of  all  the  classes  belonging  to  /•,  together 
with  the  number  of  these  classes.  The  construction  of  these  typi- 
cal groups  is  of  especial  importance,  because  isomorphic  groups 
have  the  same  factors  of  composition,  and  the  latter  play  an  impor- 
tant part  in  the  algebraic  solution  of  equations. 

One  type  can  be  established  at  once,  in  its  full  generality.     This 
type  is  formed  by  the  powers  of  a  circular  substitution.     A  group  Li 
of  this  type  is  called  a  cyclical  group,  and  every  function  of  n  ele- 
ments which  belongs  to  a  cyclical  group  is  called  a  cyclical  function. 
10 


140  THEORY    OF    SUBSTITUTIONS. 

We  limit  ourselves  to  the  consideration  of  cyclical  groups  of 
prime  degree  p.  If  s  =  (a?,  x2 .  .  .  xp),  and  if  w  is  any  primitive  pth 
root  of  unity,  then 

V  =  (•'*!  +  w#2  +  W"V(  +  •  •  ■  +  <"''    lxp)p 

is  a  cyclical  function  belonging  to  the  group  G  =  [1,  s,  s2,  .  .  .  sp~1'\. 
For  <s  is  converted  by  sa  into 

=  (»,  +  o>X2  +  .  .  .  +  a>*- lXp)*  =  <p , 

so  that  c  is  unchanged  by  the  substitutions  of  G. 

Moreover,  if  for  any  substitution  t,  which  converts  every  xa  into 
x,a,  we  have  <pt  =  cr,,  and  consequently 

then,  if  the  a*'s  are  independent  elements,  it  follows  that 

Uit  ~  lXt    =  io  ~  Ptu'y  ~  lXt   . 

Consequently  ty  =  y  +  ft  that  is,  the  substitution  /  replaces  xux2..., 
by  -'i  +/5j  '*j  -P;  •  •  •  ' '  is  therefore  contained  among  the  powers  of  s, 
and  c  belongs  to  the  group  G.  It  is  obvious  that  for  r=p,  the 
group  (?  furnishes  the  only  possible  type  i-'. 

$  130.  We  proceed  next  to  determine  all  types  of  groups  il  of 
degree  and  order  pq,  where  p  and  q  are  prime  numbers,  which  for 
the  present  we  will  assume  to  be  unequal,  p  being  the  greater. 

1 )  One  type,  that  of  the  cyclical  group,  is  already  known  to  us. 
It  is  characterized  by  the  occurrence  of  a  substitution  of  order  pq. 

2 )  If  there  are  any  other  types,  none  of  them  can  contain  a 
substitution  of  order  pq,  since  this  would  lead  at  once  to  1).  The 
only  possible  orders  are  therefore  p,  q,  1.  A  substitution  8  of  order 
p  is  certainly  present.  This  and  its  powers  form  within  Si  a  sub- 
group H  of  order  p.  If  ii  contains  any  further  subgroups  H'  of 
order  p,  their  number  must  be  /.p  -j-  1,  where  /■  >  0.  These  sub- 
groups would  have  only  the  identical  substitution  in  common. 
They  would  therefore  contain  in  all 

(p-    L)(p*+l)  +  l=p[(p    -l)*  +  l]>pg 

substitutions.     This  being  impossible,  we  must  have  x  —  0. 


CERTAIN    SPECIAL    CLASSES    OF    GROUPS.  147 

The  subgroup  H  coutains  only  p  substitutions ;  the  rest  are  all 
of  order  q.     Their  number  is 

pq—p=(q—l)p. 

There  are  therefore  p  subgroups  of  order  q,  and  consequently  from 
Theorem  I  we  must  have 

p —  1 


p  =  *q  +  l,     / 


q     ' 


that  is,  q  must  be  a  divisor  of  p  —  1.      Only  in  this  case  can  there 
be  any  new  type  Q. 

3)  The  group  if  is  a  self -conjugate  subgroup  of  fi.  Conse- 
quently every  substitution  t  of  order  q  must  transform  the  substitu- 
tion s  of  H  into  s°,  where  a  might  also  be  equal  to  1.     We  write 

(where  the  upper  indices  are  merely  indices,  not  exponents).     Then 

no  cycle  of  t  can  contain  two  elements  with  the  same  upper  index. 

For  otherwise  in   some  power  of  t  one  of  these   elements   would 

follow  the  other,  and  if  this  power  of  t  were  multiplied  by  a  proper 

power  of  s,  one  of  the  elements  would  be  removed, 

With  a  proper  choice  of  notation,  we  may  therefore  take  for  one 

cycle  of  t 

{x^XiX* .  .  .  xf). 

It  follows  then  from 

t-lst  =  sn 

that   t    replaces    x.!'    by    xa+lh+i,     x-f    by    xia+1b+1,  .  . .  xa+1h    by 
a*arr  +  ]6  +  1,  ...  so  that  we  have 

t  ==  \Xi  X}     .   .   .  X1   )   .   .  .   \Xa  -)_  i  <E<xa  4- 1  «£ar<2  -|-l     ■   •   •  X-aa'/  — l  + 1     ■  •  •  )  •  •  • 

If  now  the  latter  cycle  is  to  close  exactly  with  the  element  xaaq-i+x% 
we  must  have 

ae^  +  l^a  +  l,     aq  =  l     (mod.  p). 

The  solution  a  =  1  is  to  be  rejected,  for  in  this  case  we  should  have 

/  —  /  v  1<v  -  <r  1\  I ' v  l  y  -  v  2\  (t<  1-y  2  v  Q\ 

ot  —  It*  j  Xo     •   •   *  X  f.  <l  ,,   \   i  *JL  „   i  2     •••/•'••j 

so  that  the  latter  substitution  would  contain  a  cycle  of  more  than  q 
elements,  without  being  a  power  of  s. 


148  THEORY    OF    SUBSTITUTIONS. 

It  follows  then  from  the  congruence  aa=l  (mod.  j>)  that  q  is  a 
divisor  of  p —  1,  as  we  have  already  shown;  further  that  a,  belong- 
ing to  the  exponent  q,  has  q  —  1  values  a,,  a,,  .  .  .  arj  ,;  finally  that 
all  these  values  are  congruent  (mod.  p)  to  the  powers  of  any  one 
among  them.     From  t    \s  t  =  s"  follows 

*-2sf'-  =  s«2,  t~3sf  =  s«:i,  ... 

so  that,  if  8  is  transformed  by  t  into  any  one  of  the  powers  .saA,  there 
are  also  substitutions  in  Q  which  transform  s  into  .s"i,  s%  .  .  .  «*«— i. 
Accordingly  the  particular  choice  of  r/A  has  no  influence  on  the 
resulting  group,  so  that  if  there  is  any  type  ii  generated  by  substi- 
tutions s  and  t,  there  is  only  one. 

The  group  formed  by  the  powers  of  t  being  commutative  with 
that  formed  by  the  powers  of  s,  the  combination  of  these  two  sub- 
stitutions gives  rise  to  a  group  exactly  of  order  pq.  The  remaining 
pq — p — q-\- 1  substitutions  of  the  group  are  the  firsts/  —  1  powers 
of  thep  —  1  substitutions  conjugate  to  t 

8-p+it8p-i  =  (xjxffxf?  .  .  .  xtf)  ...      (/5  =  2,  3,  . .  .p). 

If  ji  and  ij  are  unequal,  we  have  therefore  only  one  new  type  J-\ 

§  131.  Finally  we  determine  all  types  of  groups  Q  of  degree 
and  order  p2. 

1)  The  cyclical  type,  characterized  by  the  presence  of  a  substi- 
tution of  order  p",  is  already  known. 

2)  If  there  are  other  types,  none  of  them  can  contain  a  sub- 
stitution of  order  p\  There  are  therefore  in  every  case  pl — 1  sub- 
stitutions of  order  p  and  one  of  order  1.  If  s  is  any  substitution 
of  --.  and  t  any  other,  not  a  power  of  s,  then  ii  is  fully  determined 
by  8  and  t.     For  all  the  products 

s"t"     (a,b  =  0,l,2,...p—l) 

arp  different,  and  therefore 

fl  =  (>•*»]     (0,6  =  0,1,2,  ....p— 1). 

We  must  have  therefore 

t.s  —  .s6i  t<\ ,     I  'a  =  sa-ie«,  . . .  lp    l8  =  &  ~  i  &  - 1 . 
If  now  two  of  the  exponents  d  are  equal,  it  follows  from 


CERTAIN    SPECIAL    CLASSES    OF    GROUPS.  149 

tas  =  sst%     t''s  =  sst"      (a  =  b,     e=fe') 
that 

{t"s)-\t"s)  =  s   Hs  =  (sH^-^t")  =  P. 

Since  for  t  we  may  write  t,  it  therefore  appears  that  Q  contains  a 
substitution  t  which  is  transformed  by  8  into  one  of  its  powers  V. 

The  same  result  holds,  if  all  the  exponents  d  are  different.  For 
one  of  them  is  then  equal  to  1,  since  none  of  them  can  be  0,  and 
from  t" s  =  st€  follows  s~lt"s=  t*. 

3)     There  is  therefore  always  a  substitution 

/    I  rg%    1  /y*    *  /V»     1"\    //y»    ~/y    *  /y»    -\  //y»  P /y  P  /y*    P  \ 

V    1  tA.  j    «A'2       •     *     •    **"  1>     /    V         I  2       *     *     *  f)     )     '     •     •     V  **■' 1     **-'2        •     •     •    **/«     / 

which  is  transformed  by  s  into  a  power  of  itself  V*.     As  in  the  pre 
ceding  Section,  we  may  take  for  one  cycle  of  s 

(  ™   !™   2  rp  P\ 

y«A/]    tA. j       .    .    .    tA  j     y. 

Then  from  s~1ts  =  f'  follows 

If  the  second  cycle  is  to  close  after  exactly  p  elements,  we  must 
have 

a1' +  1  =  2,     ap=l     (modp). 

This  is  possible  only  if  a  =  1.     Accordingly 

/  /-y.   *  ^yi   -  /y»  P\  ( ry*   *  /y»   *  *yi  _P  \  /  /y»    ^  -y»    "  J'  | 

—  ^iA  j  cA/j     .   .   .  u.  j   ^  \«*-2  **/2     '  •  •  **'2    /   •   •   •   V**i)  "•>     •   •   •  p   )• 

Thep  +  1  substitutions 

Oa      '   .     Oka     M      a      «      •      •      Ol 

are  all  different  and  no  one  of  them  is  a  power  of  any  other  one. 
Their  first  p — 1  powers  together  with  the  identical  substitution 
form  the  group  £. 

Summarizing  the  preceding  results  we  have 

Theorem  II.  There  are  three  types  of  groups  Q,  for  which 
the  degree  and  order  are  equal  to  the  product  of  tivo  prime  num- 
bers :  1)  The  cyclical  type,  2)  one  type  of  order  pq  (p  >  q), 
3)  one  type  of  order  p2.  The  first  and  third  types  are  always  pres- 
ent; the  second  occurs  only  when  q  is  a  divisor  of  p—1. 

§  132.  We  consider  now  another  category  of  groups,  character- 
ized by  the  property  that  their  substitutions  leave  no  element,  or 


150 


THEORY    OF    SUBSTITUTIONS. 


only  one  element,  or  all  the  elements  unchanged.  The  degree  of 
the  groups  we  assume  to  be  a  prime  number  p. 

Every  substitution  of  such  a  group  is  regular,  i.  e.,  is  composed 
of  equal  cycles.  For  otherwise  in  a  proper  power  of  the  substitu- 
tion, different  from  the  identity,  two  or  more  of  the  elements  would 
be  removed. 

The  substitutions  which  affect  all  the  elements  are  cyclical,  for  p 
is  a  prime  number.  From  this  it  follows  that  the  groups  are  tran- 
sitive, and  again,  from  Theorem  IX,  Chapter  IV,  that  the  number 
of  substitutions  which  affect  all  the  elements  is  p  —  1.  We  may 
therefore  assume  that 

S  —  (XiX-20C^  .  .  .  Xp) 

and  its  first  p — 1  powers  are  the  only  substitutions  of  p  elements 
which  occur  in  the  required  group. 

The  problem  then  reduces  to  the  determination  of  those  substi- 
tutions which  affect  exactly  p  —  1  elements.  If  t  is  any  one  of  these, 
then  t~lst,  being  similar  to  s,  and  therefore  affecting  all  the  ele- 
ments, must  be  a  power  of  s 

t      St  —  S     —  ^#*jfl?j  ^.mXt  _|_ ■>„,  .  .  .  j, 

where  every  index  is  to  be  replaced  by  its  least  positive  remainder 
(mod  2?).  Since  it  is  merely  a  matter  of  notation  which  element  is 
not  affected  by  t,  we  may  assume  that  .r,  is  the  unaffected  element. 
It  follows  that 

t  -—  [XoXm  _j_  j  X„,2  _|_  j  X  „,8  _j_  j    ...)...  ^  X„  _f_  !  Xa  ,„  _|_  i  Xn  ,„2  _|_  i  .   .   .  )  .   .    . 

If  now  <j  is  a  primitive  root  (mod.  p),  then  all  the  remainders 
(mod.  p)  of  the  firsts — 1  powers  of  g 

G)  g\g\g\...g'-\g^  =  \     (mod.  p) 

are  different,  and  we  may  therefore  put 

m^glx     (mod.  p). 

We  will  denote  the  corresponding  tbyt^.     It  appears  then  that  t^ 


consists  of  fi  cycles  of 
closes  as  soon  as 


J>  — 1 


elements  each.     For  every  cycle  of  ^ 


CERTAIN    SPECIAL    CLASSES    OF    GROUPS.  151 

(mod.  p) 


amZJr  l==a  +  lj 
m~=    gP'^l, 

p-1 


and  this  first  happens  when  z  = 

If  there  is  any  further  substitution  tv  which  leaves  xr  unchanged 
and  which  replaces  every  #0  +  ,  by  xagv+11  then  t^tf  replaces  every 
xa  +  l  by  Xagiii+Pv+i.  If  now  we  take  «  and  /3  so  that  afi-\-fiv  is 
congruent  (mod.  p)  to  the  smallest  common  divisor  at  of  //  and  v, 
we  have  in 

f     —  f    af  0 

■'(O    —    ■'Jl     ^V 

a  substitution  of  the  group,  of  which  both  t^  and  tv  are  powers. 
Proceeding  in  this  way,  we  can  express  all  the  substitutions  which 
leave  ac3  unchanged  as  powers  of  a  single  one  among  them  ta, 
where  g°  is  the  lowest  power  of  g  to  which  a  substitution  t  of  the 

group  corresponds. 

p —  1 

The  group  is  determined  by  s  and  ta .     Since  ta  is  of  order , 

it  follows  from  Theorem  II,  Chapter  IV,  that  the  group  contains  in 

aU  PSJl L  substitutions,     a  may  be  taken  arbitrarily  among  the 

divisors  of  p  —  1. 

§  133.  To  obtain  a  function  belonging  to  the  group  just  con- 
sidered, we  start  with  the  cyclical  function  belonging  to  s 

<\  =  (»,  +  "a*  +  "2*3  +  •  •  ■  +  w*-1*,)*, 
where  w  is   any  primitive  pth  root  of  unity.     Applying  to   0,  the 
successive  powers  of  ta,  we  obtain 

02  =  (*i+  a,a*,«r+I+  w2aJ2j,<r+1+  .  .  .  +  «*-»a!  u,_1(j>«r  +  1)*, 

The  powers  of  s,  forming  a  self-conjugate  subgroup  of  the  given 
group,  leave  all  the  0's  unchanged.  The  powers  of  t„,  and  conse- 
quently all  the  substitutions  satab  of  the  group,  merely  permute  the 
0's  among  themselves.     Every  symmetric  function  of 

01,02,  ...0,-i 


152  THEORY    OF     SUBSTITUTIONS. 

is  therefore  unchanged  by  every  substitution  of  the  group.  Ac- 
cordingly if  <f>  is  any  arbitrary  quantity,  the  function 

<i„  =  (0—^0  (0— 0a) . . .  (0-vV-O 

is  unchanged  by  all  these  substitutions  and  by  no  others.  Vv  there- 
fore belongs  to  the  given  group. 

§  1 34.  If,  in  particular,  we  take  a  =  1,  the  order  of  the  group 
becomes  p{p — 1).     The  substitution  ta  is  then  of  the  form 

tX     =     [OC^Xg  -f-  1    XgS  _|_  J      .      .      -     XgP  -   i   1   j, 

containing  only  one  cycle.  The  group  is  therefore  two-fold  transi- 
tive (Theorem  XIII,  Chapter  IV).  A  group  of  this  type  is  called  a 
metacyclic  group,  and  the  corresponding  function  '/'',  a  metacyclic 
function. 

If  t  =  2,  the  order  of  the  group  is    -±—= -,  and  t„  is  of  the 

form 

t.,  =  [XqX^ _|_  [  Xy4 _(_  i  .  .  .)  \X„  ^_i  Xag2^.i  xagi  + 1  .  .  .  ) 

The  indices  in  the  first  cycle,  each  diminished  by  1,  are  the 
quadratic  remainders  (mod.  p);  a  is  any  quadratic  non-remainder 
(mod.  p).  The  group  is  in  this  case  called  half -metacyclic  group 
and  the  corresponding  function  WT  a  half -metacyclic  function* 

§  135.  We  can  define  all  substitutions  of  the  groups  Q  of 
prime  degree  p,  as  well  as  those  of  the  two  preceding  Sections,  in  a 
simple  way  by  expressing  merely  the  changes  which  occur  in  the 
indices  of  the  elements  x1}x2,  .  .  .  xn.  Thus  the  substitutions  of 
ii  are  defined  by 

sa  =  \zz-\-a\      (mod.  p).     (a  =  0,  1,  2,  .  .  .p — 1), 

The  symbol  here  introduced  is  to  be  understood  as  indicating  that 
in  the  substitution  sa  every  element  x.  is  replaced  by  a\  +  a,  and  for 
z  +  a  its  least  not  negative  remainder  (mod.  p)  is  to  be  taken. 

The  groups  of  the  preceding  Section  contain  then,  in  the  first 
place,  all  the  substitutions  sa,  and  beside  these,  if  we  suppose 
every  index  to  be  diminished  by  one,  also  those  substitutions  for 
which  every  index  is  multiplied  by  the  same  factor,  that  is,  for 
z  =  0,  1,  2,  .  .  .p  —  1 

*L.  Kronecker;  cf.  F.  Klein:  Math.  Ann.  XV,  268. 


CERTAIN    SPECIAL    CLASSES    OF    GROUPS.  153 

fff  =  \z  fiz\     (mod.  p)     (0  =  1,2,3,  ...p  —  1). 
The  symbol 

t  =  \z  ,3z  +  a\     (mod.  p)     («  =  0,1,  ...p— 1;     0  =  1,2,  ...p—1) 
includes  all  the  substitutions  sa,  ^p,  and  their  combinations.     Since 

\z     {iz  -\-  a  J  .  j  z     /3jZ  +  a,|=:|z     /9/9jZ  +  ax/9 -J-  a | , 

it  follows  that  the  substitutions  t  form  a  group  of  degree  p  and  of 
order  p(p  —  1).     This  group  therefore  coincides  with  that  of  §  134. 
If  we  prescribe  that  the  /S's  shall  take  only  the  values 

the  products  /9/J,  belong  to  the  same  series,  and  we  obtain  the  group 
of  degree  p  and  of  order  — considered  above. 

§  136.  The  consideration  of  the  fractional  linear  substitutions 
(mod.  p)  leads  to  groups  of  degree  jp  + 1  and  of  order  (p  + 1)  p 
(p — 1).     These  substitutions  are  of  the  form 

az-\-$ 


11  = 


(mod.  p), 


yz  +  8 

where  z  is  to  take  the  values  0, 1,  2,  .  .  .p  —  1 ,  oo  ,  the  elements  of 
the  group  being  accordingly  x0,xlix2, . . .  xp_ !,««,.  The  values 
ai  ft,  Y,  'h  determine  a  single  substitution  u,  but  it  may  happen 
that  one  and  the  same  u  results  from  different  systems  a,  /?,  y,  8. 
To  avoid,  or  at  least  to  limit  this  possibility,  we  make  use  of  the 
determinant  of  u 
D)  ad—fr. 

According  as  this  is  a  quadratic  remainder  or  non- remainder,  we 

«z  +  ,S 


divide  numerator  and  denominator  of  r— -  by   \/a8 — ,3  y  or  by 

yz-\-o      J  J 

\/ ',3y —  ai).     For  the  new  coefficients  we  have  then 

D')  ad— pr==±l     (mod.  p). 

If    now    for   two    different   systems   of   coefficients    a,  ,5,  y,  8    and 
an  /5i  >  Y  >  '\  the  relation 

az-\-  [1 axz-\-  {i 


yz  +  8       ytz  +  8 


(mod.  p) 


154  THEORY    OF    SUBSTITUTIONS. 

were  possible,  it  would  follow  from  the  comparison  of  the  coeffi- 
cients of  z2,  z\  and  z°,  with  the  aid  of  D',  that  if  a,  a', ,;,  ,5',  .  .  .  are 
real, 


«../3__r_«J_        /  ad— fly  _ 
~ZT  =  -oT  =  -— t  =  tt-  -  A/-Tv 77-7  =  ^±l     ( mod. 


P)- 


If,  therefore,  we  restrict  the  range  of  the  values  of  a,  /?,  ^,  '5  to 
0,1,2,  .  .  .  p  —  1,  there  are  always  two  and  only  two  different  sys- 
tems of  coefficients  which  give  the  same  substitution  u. 

With  D')  it  is  assumed  that  ad —  ,iy  is  different  from  0.  This 
restriction  is  necessary,  for  the  symbol  u  can  represent  a  substitu- 
tion only  if  different  initial  values  of  z  give  rise  to  different  final 
values  of  z,  i.  e.,  if  the  congruence 

az-\-[i aZj  -j-i9 


yz+8       yz,  +  Z 


(mod.  p) 


is  impossible.     This  is  ensured  by  the  assumption  ad  —  i3y==0. 

We  determine  now  how  many  elements  are  unchanged  by  the 
substitution  u.     An  index  z  can  only  remain  unchanged  by  u  if 

E)  rz2  +  ('>  —  ")z  —  0=0     (mod.  p). 

There  are  accordingly  four  distinct  cases: 

a)       The  two  roots  of  E)  are  imaginary.     This  happens  if 


m 


T  1  {ad— pr=±l) 


is  a  quadratic  non-remainder  (mod.  p).     The  corresponding  substi- 
tutions affect  all  the  elements  ac0J  .<•, ,  x2,  . . .  xp_1}  x^ . 

b)  The  two  roots  of  E)  coincide.     This  happens  if 

(nrO*1-0    ^mod-^)    («*— /»r=±l). 

The  corresponding  substitutions  leave  one  element  unchanged. 

c)  The  two  roots  of  E)  are  real  and  distinct.     This  happens  if 

(=£)'*  i         (.»-/»/=  ±i) 

is  a  quadratic  remainder  (mod.  p).     The  corresponding  substitutions 
leave  two  elements  unchanged. 

d)  The  equation  E)  may  vanish  identically.     This  happens  if 

r=0,  ,5  =  0,  a=d     (mod.  p). 


CERTAIN    SPECIAL    CLASSES    OF    GROUPS.  155 

The  corresponding  substitution  leaves  all  the  elements  unchanged. 
Finally  we  observe  also  that 


az  +  fi 
yZ  +  d 


z 


'  (r«i+^i)*+(rft+Mi) 


M) 

yz  +  d  yxz  +  <\ 

N)  (ad—Py)  («!'?!  —  yJ,  r,)  =  (aaj  +  pri)  (yPj  +  38r ) 

—  iafi}  +  fid1)(ral  +  9ri). 

We  proceed  now  to  collect  our  results.  If  we  take  a  not  E  0 
(mod.  p),  and  /3  and  /-arbitrarily,  then  for  each  of  the  (p —  l)p2 
resulting  systems  we  obtain  two  solutions  of  D').  Since  however 
there  are  always  two  systems  of  coefficients  which  give  the  same 
substitutions  u,  we  have  in  all,  in  the  present  case,  p' — p2  substitu- 
tions. Again,  if  we  take  a  =0  (mod.  p)  and  8  arbitrarily,  then 
restricting  /5  to  the  values  1,  2,  .  ..p  —  1,  we  obtain  from  D')  for 
every  system  a,  S,  (3  two  values  of  y;  but  as  two  systems  of  coef- 
ficients give  the  same  u,  we  have  in  this  case  p{p — 1)  substitutions. 

There  are  therefore  in  all  p3 — P  =  (p-\-l)  p(p — 1)   fractional 

linear  substitutions  (mod.  p).     From  M)  it  appears  that  these  form 

1 1 '  ~\~  1 )  P  ( P  —  1 ) 
a  group.      Among   them   there  are  - —         %  -  substitutions 

a 

which  correspond  to  the  upper  sign  in  D').  From  M)  and  N)  it  is 
clear  that  these  also  form  a  group.  This  latter  group  is  called  "the 
group  of  the  modular  equations  for  p".* 

Both  groups  contain  only  substitutions  which  affect  either  p  -\-  1, 
or  p,  or  p  —  1  elements,  or  no  element.  Those  substitutions  which 
leave  the  element  xn  unchanged,  for  which  accordingly  y=0,  form 
the  metacyclic  group  of  §  134.  As  the  latter  is  two- fold  transitive, 
it  follows  (Theorem  XIII,  Chapter  IV)  that  the  group  of  order 
(p  -\-  l)p(p  —  1)  is  three-fold  transitive. 

Theorem  III.  The  fractional  linear  substitutions  (mod.  p) 
form  a  group  of  degree  p-\-l  and  of  order  (p  -|- 1)  p  (p  —  1). 
Those  of  which  the  determinants  are  quadratic  remainders  (mod.p) 

( p  -\-  1)  jo  ( p  —  1) 
foi-m  a subgroupt of  order  ^—        £     '■>  the  group  of  the  modu- 

lar  equations  for  p.  If  any  substitution  of  these  groups  leaves 
more  than  tivo  elements  unchanged,  it  reduces  to  identity.  The 
first  of  the  two  groups  is  three  fold  transitive. 

*  Cf.  J.  Gierster:  Math.  Ann.  XVIII,  p.  319. 


150  THEORY    OF    SUBSTITUTIONS. 

To  construct  a  function  belonging  to  the  group  of  the  fractional 
linear  substitutions,  we  form  first  as  in  §  183,  a  function  '/',  of  the 
elements  x0,  .r,,  .<•.,  .  .  .  xp  ,  which  belongs  to  the  group  of  substi- 
tutions 

t=\z ■■  ,3z+  a\    (mod.  p).    («  =  0,  1,  2,  .  .  . /-    -1;  /3=1,  2,  . .  .p— 1) 

The  substitutions  u,  applied  to  '/'", ,  produce  p  -\-  1  values 

'  1 >     '  2  J    •    ■    •     rp  +  1 > 

which  these  substitutions  merely  permute  among  themselves.    Ac 
cordingly,  if  '/''  is  any  undetermined  quantity,  the  function 

2  =  (♦/•—  '/■•,)('/■•— '/';)...<'/  —  v;  +  1) 
belongs  to  the  given  group. 

§  187.  We  have  now  finally  to  turn  our  attention  to  those 
groups  all  the  substitutions  of  which  are  commutative. 

We  employ  here  a  general  method  of  treatment  of  very  exten- 
sive application.* 

Suppose  that  0',  6",  (>'" .  .  .  are  a  series  of  elements  of  finite 
number,  and  of  such  a  nature  that  from  any  two  of  them  a  third 
one  can  be  obtained  by  means  of  a  certain  definite  process.  If  the 
result  of  this  process  is  indicated  by  /,  there  is  to  be,  then,  for 
every  two  elements  0',  0",  which  may  also  coincide,  a  third  element 
9'",  such  that  /("'  (>")  =  <>'".     We  will  suppose  further  that 

/(*',  0")  =f(0",  6% 
flo',f(o",o'")]=f[f(o',o"}ji'"ii, 

but  that,  if  0"  and  0'"  are  different  from  each  other,  then 

These  assumptions  having  been  made,  the  operation  indicated  by  / 
possesses  the  associative  and  commutative  property  of  ordinary 
multiplication,  and  we  may  accordingly  replace  the  symbol  /("',  "") 
by  the  product  0'0",  if  in  the  place  of  complete  equality  we  employ 
the  idea  of  equivalence.     Indicating  the  latter  relation  by  the  usual 

sign  oo ,  the  equivalence 

II'  n"  co  ""■' 

is,  then,  defined  by  the  equation 

f(0\  II"  )  =  ()'". 

*\j.  Kronecker:  Monatsber.  d.  Berl.  Akad..  1870.  p.  881.  The  following  is  taken 
for  the  mosl  part  verbatim  from  this  article. 


CERTAIN    SPECIAL    CLASSES    OF    GROUPS.  157 

Since  the  number  of  the  elements  0,  which  we  will  denote  by  n, 
is  assumed  to  be  Unite,  these  elements  have  the  following  properties: 

I)  Among  the  various  powers  of  an  element  0  there  are  always 
some  which  are  equivalent  to  unity.  The  exponents  of  all  these 
powers  are  integral  multiples  of  one  among  them,  to  which  0  may 
be  said  .to  belong. 

II)  If  any  0  belongs  to  an  exponent  v,  then  there  are  elements 
belonging  to  every  divisor  of  v . 

III)  If  the  exponents  p  and  <r,  to  which  6'  and  0"  respectively 
belong,  are  prime  to  each  other,  then  the  product  0'  0"  belongs  to  the 
exponent  pa. 

IV)  If  )i  |  is  the  least  common  multiple  of  all  the  exponents  to 
which  the  ;/  elements  n  belong,  then  there  are  also  elements  which 
belong  to  n , . 

The  exponent  ft,  is  the  greatest  of  all  the  exponents  to  which 
the  various  elements  belong.  Since,  furthermore,  nt  is  a  multiple 
of  every  one  of  these  exponents,  we  have  for  every  ('  the  equival- 
ence   l'":  CO  1 

§  138.  Given  any  element  0t  belonging  to  the  exponent  u, ,  we 
may  extend  the  idea  of  equivalence,  and  regard  any  two  elements 
0'  and   6"  as   "relatively  equivalent"   when  for  any  integral  value 

of  k 

<>'  ■» ',' :coii" 

We  retain  the  sign  of  equivalence  to  indicate  the  original  more  lim- 
ited relation. 

If  now  we  select  from  the  elements  0  any  complete  system  of 
elements  which  are  not  relatively  equivalent  to  one  another,  this 
subordinate  system  satisfies  all  the  conditions  imposed  on  the  entire 
system  and  therefore  possesses  all  the  properties  enumerated  above. 
In  particular  there  will  be  a  number  ji.,  ,  corresponding  to  w.ls  such 
that  the  u.,th  power  of  every  0  of  the  new  system  is  relatively  equiv- 
alent to  unity,  i.  e.,  ^"-c\o"/.  Again  there  are  elements  (>,,  in  the 
new  system  of  which  no  power  lower  than  the  >i,th  is  relatively 
equivalent  to  unity.  Since  the  equivalence  (>"'co  1  holds  for  every 
element,  and  consequently  a   fortiori  every   i'"-  is  relatively  equiva- 


158  THEORY    OF    SUBSTITUTIONS. 

lent  to  unity,  it  follows  from  I)  than  a,  is  equal  to  n2  or  is  a  multiple 
of  )i  . 
If  now 

and  if  both  sides  are  raised  to  the  power    — ,  we  obtain,  writing 

—  =  m.  the  equivalence 

(\ icvdI. 

From  this  it  follows  that,  since  0j  belongs  to  the  exponent  nl ,  m  is 
an  integer  and  k  is  therefore  a  multiple  of  n., .  There  is  therefore 
an  element  (>.,,  defined  by  the  equivalence 

ii,n;"coi>n      or     0aoo0„81ni-m 

of  which  the  u.,th  power  is  not  only  relatively  equivalent,  but  also 
absolutely  equivalent  to  unity.  This  element  belongs  both  rela- 
tively and  absolutely,  to  the  exponent   it,,  for  we  have  the  relation 

".,"■- co  0„ ""-  ",">"•-    '" "'-co  ('V'7',"1"-"'"  "-co  <V>  "-co  1. 

Proceeding  further,  if  we  now  regard  any  two  elements  0'  and 
0"  as  relatively  equivalent  when 

0'  0*  0* co 0", 

we  obtain,  corresponding  to  (>.,,  an  element  08  belonging  to  the  expo- 
nent n3,  where  nz  is  equal  to  n.,  or  a  divisor  of  n2;  and  so  on.     We 
obtain  therefore  in  this  way   a  fundamental   system  of    elements 
11  \  >  ".>  >  ".>.  5  •  •  •  which  has  the  property  that  the  expressions 
0,*i02*208V  .  .      (h,=  1,2,..  .n) 

include  in  the  sense  of  equivalence  every  element  0  once  and  only 
once.  The  number  w, ,  n., ,  w3 ,  .  . . ,  to  which  the  elements  0mi ,  <>., ,  dt , . . 
belong,  are  such  that  every  one  of  them  is  equal  to  or  is  a  multiple 
of  the  next  following.  The  product  »,  n.,  n^ ...  is  equal  to  the 
entire  number  n  of  the  elements  0,  and  this  number  n  accordingly 
contains  no  other  prime  factors  than  those  which  occur  in  the  first 
number  ?i, . 

§  1 89.  In  the  present  case  the  elements  0  are  to  be  replaced  by 
substitutions  every  two  of  which  are  commutative.  The  number  n 
of  the  elements  0  becomes  the  order  7*  of  the  group.  We  have 
then 


CERTAIN    SPECIAL    CLASSES    OF    GROUPS. 


159 


Theorem  IV.  //  all  the  substitutions  of  a  group  are  com- 
mutative, there  is  a  fundamental  system  of  substitutions  s, ,  s2,  s3, .  . . 
which  possesses  the  property  that  the  products 

V WV:: .  .  •  (hi  =1,2,...  ?-,) 
include  every  substitution  of  the  group  once  and  only  once.  The 
numbers  rlt  r.2,  r8,  .  .  .  are  the  orders  of  su  s2,  s3,  .  .  .  and  are  such 
that  every  one  is  equal  to  or  is  divisible  by  the  next  following.  The 
product  of  these  orders  r,,  r2,  r3,  . . .  is  equal  to  the  order  r  of  the 
group. 

The  number  i\  is  determined  as  the  maximum  of  the  orders  of  the 
several  substitutions.  On  the  other  hand  the  corresponding  substi- 
tution sx  is  not  fully  determined,  but  may  be  replaced  by  any  other 
substitution  s/  of  order  r, .  According  then  as  we  start  from  sl  or 
s/,  the  values  of  r2,r8,.;.  might  be  different.  We  shall  now 
show  that  this  is  not  the  case. 

In  the  first  place  it  is  plain  that  if  several  successive  s's  belong 
to  the  same  exponent  r,  these  s's  may  be  permuted  among  them- 
selves, without  any  change  in  the  r's.  Moreover,  every  sa  can  be 
replaced  by  saflsa+iv  sa+2T  •  •  •  without  any  change  in  the  r's,  pro- 
vided only  that  fi  is  prime  to  ra. 

If  now  the  given  group  can  be  expressed  in  the  two  different 
forms 

*  W  •  •  •  (h,  =  1,  2,  .  .  .  r,),       <r»3ft3  .  .  .  (/i,  =  1,  2,  .  .  .  Pi), 

then  /',  =  r, ,  and 

<r,  =  SfsfS/  .  .  . 

Since  <r1  belongs  to  r, ,  at  least  one  of  the  exponents  //,  v,  .  .  .  must 

be  prime  to  r, .     From  the  first  remark  above,  we  may  assume  that 

this  is  fi,  and  from  the  second  it  follows  that  the  group  can  also  be 

expressed  by 

ff»3*»...     (h(=  1,2,  .../-,■;  pl  =  r1). 

Consequently  the  groups 

s.," %"3 . .  .  (ft,.  =  1,  2,  .  .  .  r,-),       tAV3  •  •  •  (hi  =1,2,...  Pt) 

are  identical.       From  this  it  follows,  as  before,  that  p2  =  r2,  and 

so  on. 

Theorem  V.      The  numbers   rt,  r,,  r3,  .  .  .    are  invariant  for 

a  given  group* 

*This  theorem  is  due   to  Frobenius    and  Stickelberger.   cf.  their  article:  Uber 
Gruppen  mit  vertauschbaren  Elementen ;  Crelle,  86,  pp.  217-262. 


CHAPTER  VIII. 


ANALYTICAL  REPKESENTATION  OF  SUBSTITUTIONS. 
THE  LItfEAB  GKOUP. 

§  140.  In  the  preceding  Chapter  we  have  met  with  a  fourth 
method  of  indicating  substitutions,  which  consisted  in  assigning  the 
analytic  formula  by  which  the  final  value  of  the  index  of  every  ■<•  is 
determined  from  its  initial  value.  Thus,  if  the  index  z  of  every  .r, 
is  converted  by  a  given  substitution  into  ?{z),  so  that  xz  becomes 
a?0,,),  the  substitution  is  completely  defined  by  the  symbol 

S=  \z   e(z)   . 

Obviously  not  every  function  can  be  taken  for  <s(z),  for  it  is  an 
essential  condition  that  the  system  of  indices  cr(  1 ),  cr(2),  . .  .  y>(w) 
shall  all  be  different  and  shall  be  identical,  apart  from  their  order, 
with  the  system  1,  2,  3,  .  .  .  n.  On  the  other  hand  it  is  readily 
shown  that  every  substitution  can  be  expressed  in  this  notation.. 
For  if  it  is  required  that 

?(1)  =  /,.    90(2)  =  ^,  .  .  .  c{h)  -    /   . 

we  can  construct,  by  the  aid  of  Lagrange's  interpolation  formula 
from 

F$  =  (z— l)(z—  2).  .  .(z-  n) 

a  function  <f{z)  which  satisfies  the  conditions,  viz: 

F(z)  .         /<•<--)  .  F(z) 


[F'(z)(z-   \)  '  riF'(z)(z— 2)  '    ■"    '    nF'{z){z—n)' 

This  function  is  of  degree  n  1  in  z.  It  is  evident  that  there  are 
an  infinite  number  of  other  functions  <p{z)  which  also  satisfy  the 
required  conditions. 

Jj  141.  If  ii  is  a  prime  number  p,  we  can  on  the  one  hand 
diminish  the  restrictions  imposed  on  tp  by  permitting  the  indices 
1,  2,  8,  .  .  .  p  to  be  replaced  by  any  complete  system  of  remainders 
(mod.  p),  so  that  indices  greater  than  p  are  also  allowable.     And  on 


ANALYTICAL    REPRESENTATION    OV    SUBSTITUTIONS.  161 

the  other  hand  we  can  depress  every  form  of  <p(z)  to  the  degree 
»  —  1,  since  sf=z  (mod.  p)  for  all  values  of  z. 

In  particular,  we  have  in  this  case  F(z)=zp —  z  and 
F'(z)      pz>'    l  —  1=      1. 

For  »  ==  p,  the  functions  <p{z)  which  are  adapted  for  the  expres- 
sion of  a  substitution,  for  which  therefore  <p(0),<p(i),  .  .  .  <s(p —  1) 
form  a  complete  system  of  remainders  (mod.  p),  are  defined  by  the 
following  theorem: 

Theorem  I.  In  order  that  i  <pz  may  express  a  substitu- 
tion of  p  elements,  it  is  necessary  and  sufficient  that  after  <p{z)  and 
its  first  p  —  2  powers  have  been  depressed  to  the  degree  p  —  1  by 
means  of  the  congruence  z''=z  (mod,  p),  and  after  all  multiples  of 
p  have  been  removed,  these  p  —  1  powers  of  tp{z)  should  all  reduce  to 
tfw  degree  p  —  2.  * 

Let 

<p(z)  =  A0+A1z  +  A2z2+  .  .  .  +A„    .i""1 

be  any  integral  function  (mod.  p),  and  suppose  that 

[<p(z]\m=  A0W  +  A1Wz  +  A2Wz2+  .  .  .  +AP    t<mV    '     (mod.  p). 

Since  for  every  «  <  p  —  1 

0«  +  la  +  2a  +  .  .  .  +  (p  —  1 )"      0     ( mod.  p), 
we  have 

s)     [?(0)]"+i>(i)]";+  •  •  •  +[Kp— i]"'  =(p—i)Ap_1(.my 

=  —  At,    ,'""     (mod.  p). 

If  now  <p(z)  is  adapted  for  the  expression  of  a  substitution,  then,  as 
p(0),  ^(1), .  .  .  <f(p  —  1)  form  a  complete  system  of  remainders 
(mod.  p),  we  conclude  that  for  m  <p —  1 

Ap  0     (mod.  p). 

This  is  therefore  a  necessary  condition. 

Conversely,  if  this  condition  is  satisfied  for  a  given  function 
viz),  then  since  S)  holds  for  m  =  1,  2,  ...p  —  2,  it  follows  from 
formula  B)  of  §  8  that 

\z— 9>(0)]|>—  ?(1)]  .  .  .  0  —  <r(p-  -1>]  .,-z"  —  «z- ;? 

=  (1 —  a)z  —  ,3      (mod.  p). 

*Hermite:  Comptes  reiulustle  I'Academie  cles  Sciences,  vr. 
11 


162  THEORY    OF    SUBSTITUTIONS. 

Accordingly,  if  a=pO,  the  linear  congruence  (1 — a)z —  /3=(mod.  p) 
is  satisfied  by  the  p  integers  <p(Q),<s(l),  .  .  .  c(p—  1).  These  must 
therefore  all  be  equal,  and,  as  their  sum  is  0,  every  one  of  them  is 
equal  to  0.     But  in  this  case  the  congruence  of  degree  p  —  2 

<p(z)  =  A0  +  Axz  +  A, z1  +  .  .  .  +  Ar    a z"  - a =0     (mod.  p) 

would  have  p —  1  different  roots  z  — 0,1,2,  ...  p  —  1,  which  is 
impossible.     Consquently  «  =  1  and  then  {i  =  0,  that  is 

[z-9(0)]  O-f(l)]  .  .  .  \z—<p{p-l)\=z*-z 

=z(z-l)(z-2)  .  .  .[z-(p-l)-], 

and  the  values  ?(0),  <p(l),  .  .  .  erf/*  -1)  coincide  with  0,l,...p  —  1, 
apart  from  their  order.  It  appears  therefore  that  the  condition 
stated  in  Theorem  I  is  both  necessary  and  sufficient  to  insure  that 
|  z  <pz  |  defines  a  substitution. 

§  142.  To  distinguish  the  individual  elements  of  any  system 
we  may  also  employ  several  indices  in  each  case  instead  of  a  single 
index  as  heretofore.  For  example,  in  the  case  of  p"  elements  the 
indices  z  and  u  of  a?3]  „  might  each  assume  any  value  from  0  to 
p  —  1.     Any  substitution  among  these  p"  elements  could  then  be 

denoted  by 

s=\z,u     <f{z,  u),  <!<(z,  u)  | 

where  <p{z,  u)  and  4'{z,  u)  must  satisfy  conditions  similar  to  those  of 
§140. 

If  n  =  p*  the  elements  could  be  denoted  by 

ocZ} ,#L, .  .  . rfCk     (z,-  —  0, 1,  2,  ... p  —  1), 
and  any  substitution  8  by  the  symbol 

s  =  \zl,z2,...zk.     <fx(zx  ,Z2,... Zk),  <f2(Zi,Z2,. . . Z,).  .  .  .  <pk{Zi ,z2,...zh)\, 

which  is  to  be  understood  as  indicating  that  every  index  2,  is  to  be 
converted  into  f,(,2n  z,,  .  .  .  zk).  The  functions  <pu  </■,,  .  .  .  <pk  must 
then  be  so  taken  that  the  pk  different  systems  of  indices  zx,z2,  .  .  .  zk 
give  rise  to  //'  different  systems  <fx,  <f2,  .  .  .  9*. 

These  considerations  could  be  further  extended  to  include  the  case 
where  n  contains  several  distinct  prime  factors,  but  as  the  theory 
then  becomes  much  more  complicated,  we  do  not  enter  upon  it  here. 

§  143.  The  simplest  analytical  expressions  for  substitutions  of 
n  =  mh  elements  are  those  of  the  linear  form 


ANALYTICAL    REPRESENTATION    OF    SUBSTITUTIONS.  163 

1)  8olJ«s,...«fc=  |*i,  *3,  ...Zh       Zt  +  au  Z2  +  «,,  .  .  .  Zh+ ah\. 

The  a's  are  arbitrary  integers  (mod.  to).  They  can  therefore  be 
selected  in  mh  different  ways,  so  that  there  are  m*  substitutions  of 
this  type.     Again,  since 

these  arithmetic  substitutions  *  form  a  group  of  order  and  degree 
TO*.  This  group  is  transitive,  since  the  a's  can  be  so  chosen  that 
any  given  element  x^ ,..,,.,.  ,k  is  replaced  by  any  other  element 
•'si  •  i°, •••  &•     For  this  purpose  we  need  only  take 

a,  —  ,, — Z],       a2  —  „2 —  £2j  .  .  .  ak.  _  ,A — zk. 

There  is  only  one  substitution  of  the  group  which  produces  this 
result. 

In  order  that  an  arithmetic  substitution  may  leave  any  element 
x  unchanged,  it  is  necessary  that 

a,  =0,     otj  =  0,  . .  .  fljj.  =  0     (mod.  to) 

Such  a  substitution  leaves  all  the  elements  unchanged,  and  there- 
fore reduces  to  identity.  The  present  group  is  therefore  included 
in  the  groups  £2  considered  in  the  preceding  Chapter. 

By  the  continued  application  of  the  formula  2)  we  obtain 

Sa,  ,  a, .  .  .  .  a;.  =  S\  ,  0  ,  .  .  .  0   '  •  SQ  ,  1  ,  .  .  .  0   2  .  .  .  S0 ,  0 ,  .  .  .  1    * 

so  that  we  may  define  the  group  by 

")  lT=|£l,0,...0,     *d,l,...0!   •  •   •  S0,0,...l  )  • 

The  substitutions  contained  in  the  parenthesis  are  all  commuta- 
tive, and  the  same  property  consequently  holds  for  all  the  substitu- 
tions of  G. 

§  144.     We  determine  now  the  most  general  form  of  the  substi- 
tutions 

t  =  |  Zi ,  0a, . . .  zk     <fx{zx  ,z,,...  zk),  tp%{zx  ,z,,...  zk), . . .  <ph{zx  ,z,,...  zk)  I , 

which  are  commutative  with  G,  for  which  therefore 

t~l*n....t  =  **,... 

It  is  obviously  sufficient  to  take  for  s^,...  the  several  genera- 
ting substitutions    given    in    3).       The    substitution    t~ls1%0,..0t 


Cauchy:  Exercices  III.,  p.  232. 


164  THKOKV    OF    SUBSTITUTIONS. 

replaces     c'Au, ,  z...  .  .  .  zk.)    by     <p\(zl-\-l,z2, . . .  zk).     Consequently, 

taking  /  =  1 . *-!.  3,  ...  A-  we  have 

c,v(  s,  +  l,  z2i  . . .  -;, )  =  v'a<  '-, .  s...  ■  •  ■  -/. )  -f  "a     (mod.  m). 

Similarly  in  the  case  of  the  substitutions    s0,  , *„.,, ,  we 

obtain 

,      pA(*i,  "-_■  +  1.  •  •  •  "-/»       Pa(«i,  *8,  ■  ■  ■  ~->.)  +  bA     (mod.  m) 

cA{inz.,,  .  .  .  g*  +  l)  =  ?A(zi,*s,  •  •  •  2*)  +  Ca     (mod.  ///). 
From    these  congruences  it    appears    at   once    that    the    c'A's    are 
linear    functions    of    the   z\b,    having    for    their    constant    terms 
tfA=  /x(0,0,0,  .  . .  0).     The  remaining  coefficients  are  then  readily 
found.     In  fact,  we  have 

c-A(~, ,  z2,  ...zk)  =  aK i,  +  bxz2  -f  .  .  .  +  eKz,,  +  5A, 
and  therefore 

t  =     :  .  :  | .  .  .  .  zk     «,2,  +  btZ2  +  .  .  .  +  C,«,  +  '', . 

a2z,  +  b,z.,  +....+  c2«*  +  ''.,...   . 
Conversely  all  substitutions  of  this  type  transform  the  group  G  into 
itself.     Thus,  for  example,  t  transforms  s, „  into 

a  -.,  \-biZ2-\-  .  .  .  +c1zk  +  811  .  .  . 

a,(  s,  +  1 )  +  &,2r2  +  ...+,.,  ?,..+  *, 

i.  e.,  into  the  arithmetic  substitution 

'H  -.'•■•■  -/.         »1     I     ai  )  "J     I     a2j   •   •   •    **     I     "'■        ~  *aj  .  a. .  .  .  .  a/..- 

By  left  hand  multiplication  by 

•s'6, ,  8, ,  . . .  8*      '  =  s     6,  .      &J ...        5,.. 

we  can  reduce  t  to  the  form 
f  =  \zuZ2,...Zk      dlZ1  +  blZ2+  ...+CX2    .  "  .:      j-/,.;.-j-  .  .  .  +  <•.:    . 

. .  .  a»g,  -hM2+  •  •  •  +c*»*|. 

Such  a  substitution  is  called  a  geometric  substitution.* 

We  proceed  to  examiue  this  type.  We  have  already  demon- 
strated 

Theorem  II.  All  geometric  substitutions  and  their  combi- 
nations with  the  arithmetic  substitutions,  and  no  others,  arc  com- 
mutative with  the  group  of  the  arithmetic  substitutions. 


•Cauchy:  loc.  clt. 


ANALYTICAL    REPRESENTATION    OF    SUBSTITUTIONS. 


165 


§  145.     We   have    first   of  all  to  determine   whether  the   con- 
stants aA,  frA,  .  .  .  cx  can  be  taken  arbitrarily.     They  must  certainly 

be  subjected  to  one  condition,  since  two  elements  ■*"-,, -., _v   and 

.»b]   ^ gj.  must  not  be  converted  into  the  same  element  unless  the 

indices    zt,  z.,,  .  .  .  zk    coincide    in  order    with    ',,',,  .  .  ,~k.     More 
generally,  given  any  system  of  indices  Xx,  -,,  .  .  .  ~k ,  it  is  necessary 
that  from 
aizl-\-bjz.,-\-...-\-cizl       ~i,  a.,Z\  -\-b.2z.2-\- ...  +  c22/.  =  T, , . . .    (mod.  m) 

the  indices  zn  z.,,  .  .  .  zk  shall  be  determined  without  ambiguity. 
In  other  words,  the  mk  systems  of  values  z  must  give  rise  to  an 
equal  number  of  systems  of  values  ~ .  The  necessary  and  sufficient 
conditions  for  this  is  that  the  congruences 

«$,  +  b^., -j- . . .  +  c,2k=0,  a.2zx  -\-  b,z.,  -\- . . .  +  Co^.^0, . . .      (mod.  m) 

shall  admit  only  the  one  solution  zx  =  0,  z2  =  0,  .  . .  zh  =  0.  If  the 
determinant  of  the  coefficients  is  denoted  by  J,  these  congruences 
are  equivalent  to 

J  •  Zi  =  0,  J  .  z.2  =  0,  . .  .  J  -2,,  =  0     (mod.  />/ ). 

The  required  condition  is  therefore  satisfied  if  and  only  if  J  is 
prime  to  m.     We  have  then 

Theorem  III.     In  order  that  the  symbol 

t  =  zx ,  z, ,...zk    axzx  +  bxz,  +  . . .  +  ctzk ,  a,zl  +  b,z,  +  . . .  +  c,zL , . . .  | 

(mod  m) 

may  denote  a  (geometric)  substitution,  it  is  necessary  and  sufficient 

that 

aM  6lf  .  .  .cx 


a.2,  b>, 


c, 


a*,  bk,  .  .  .  C; 
should  be  prime  to  the  modulus  m. 

§  146.  From  this  consideration  it  is  now  possible  to  determine 
the  number  r  of  the  geometrical  substitutions  corresponding  to  a 
given  modulus  m. 

We  denote  the  number  of  distinct  systems  of  p  integers  which 
are  less  than  m  and  prime  to  m  by  [m,  p\.  It  is  to  be  understood 
that  any  number  of  the  ;>  integers  of  a  system  may  coincide. 


106  THEORY    OF    SUBSTITUTIONS. 

Suppose  N  to  be  the  number  of  those  geometric  substitutions 

1,  t..,  t:i,  .  .  .  which  leave  the  first  index  zx  unchanged.  If  then  ra  is 
any  substitution  which  replaces  z,  by  alzl  -\-  b^.,  -\-  .  .  .  +c,z*.,  "then 
ri)  ^ir.<  t»Tn  •  •  •  are  all  the  substitutions  which  produce  this  effect, 
and  these  are  all  different  from  one  another.    Similarly,  if  r ..  replaces 

2,  by  a,/«i  +  6]/«a+  .  .  .  +  C|'zfc,  then  r8,  £2t8,£8t8,  . . .  are  all  the 
substitutions  which  produce  this  effect,  and  these  are  all  different, 
and  so  on.  We  obtain  therefore  the  number  r  of  all  the  possible 
geometric  substitutions  by  multiplying  N  by  the  number  of  substi- 
tutions 1,  t2,  t8j  .  .  . 

The  choice   of   the  systems    an  blt  .  .  .  c,;  a/, 6/,  .  .  .  c/;  .  .  .    is 

limited  by  the  condition  that  that  the  integers  of  a  system  cannot 

have  a  same  common  factor  with  ra.     There  are  therefore  [ra,  A:] 

such  systems,   and  an   equal   number  of  substitutions    1,  r2,  t8,  .  .  . 

Consequently 

r=  [ra,  k]N. 

The  substitutions  t  are  of  the  form 

|z,,z,,  .  .  .zk    z^a^  +  boZ,-^ c,zk,  .  .  .  a&1  +  bkz2+  .  .  .  +  ckzk\ 

.  (mod.?//). 

Since  a2,a3, . .  .  ak  do  not  occur  in  the  expression  of  the  discrimi- 
nant J,  these  integers  can  be  chosen  arbitrarily,  i.  e.,  in  m  '  dif- 
ferent ways.     The  bK ,  .  .  .  cA  are  subject  to  the  condition  that 

&2  ,  .  .  .  C8 

lh,  ■  ■  -ck 

must  be  prime  to  tn.     If  the  number  of  systems  here  admissible  is 

r,  we  have 

r  =  [ra,  &]  ra*-  V. 

The  number  r'  has  the  same  significance  for  a  substitution  of 
k — 1  indices  (mod.  ra)  as  r  for  k  indices.     Consequently 

r  =  [ra,  A;]  rafc_1  [ra,  A- —  1]  mk~  V, 
and  so  on.     We  obtain  therefore  finally 

r  =  [>//,/,  |  ///'    l[ra,ifc— l]ra*  -".  .  .  [ra,  2|/"     ", 

where   r(/     ''  corresponds  to  a    single  index,   and   therefore  r<fc_l) 
~[ra,  1].      Hence 


ANALYTICAL    REPRESENTATION    OF    SUBSTITUTIONS.  167 

4)  r  =  [m,  k I  mh~l  [m,  A; —  1]  mk~ 2 .  .  .  [ra,  2] ra [ra,  1]  . 

The  evaluation  of  [m,  A-j  presents  little  difficulty.  We  limit  our- 
selves to  the  simple  case  where  ra  is  a  prime  number  p,  this  being 
the  only  case  which  we  shall  hereafter  have  occasion  to  employ.  We 
have  then  evidently 

5)  [P»/°]=PP— li 

since  only  the  combination  0,  0 ,  ...  0  is  to  be  excluded.     By  the 
aid  of  5),  we  obtain  from  4) 

6)  r  =  (pk—l)pk-1(pk-1—l)pk-a . . .  (p2  —  l)p(p—l) 

=  (pA' — 1)  (pk — p)  (pk — p~)  .  . .  (p'c — pk~1).* 

§  147.  The  entire  system  of  the  geometric  substitutions 
(mod.  m)  forms  a  group  the  order  of  which  is  determined  from  4) 
or  from  6).  This  group  is  known  as  the  linear  group  (mod.  ra). 
If  the  degree  is  to  be  particularly  noticed,  we  speak  of  the  linear 
group  of  degree  mk. 

It  is  however  evident  that  all  the  substitutions  of  this  group 
leave  the  element  x0 ,  „ ,  .  .  .  „  unchanged.     For  the  congruences 

axzx  +  bfy  +  .  .  .  4-  0,3*= 3, ,     a**,  +  b,z2  -f  &2z2+  .  .  .  +  c2zk=z2,.  .  . 

(mod.  ra) 

have  for  every  possible  system  of  coefficients  the  solution 

Z!  =  0,     z2=0,  .  .  .  zA.  =  0     (mod.  nt). 

We  shall  have  occasion  to  employ  the  linear  group  in  connection 
with  the  algebraic  solution  of  equations. 

Theorem  IV.  The  group  of  the  geometric  substitutions 
{mod.  ra),  or  the  linear  group  of  degree  mk  is  of  the  order  given  in 
4).  Its  substitutions  all  leave  the  element  a?0>oj...o  unchanged.  It 
is  commutative  with  the  group  of  the  arithmetic  substitutions. 

♦Galois:  Liouville  Journal  (1)  XI,  1846,  p.  410. 


PART   II. 

- 

APPLICATION  OF   THE  THEORY  OF  SUBSTITUTIONS  TO 
THE  ALGEBRAIC  EQUATIONS. 


CHAPTER  EX. 

THE    EQUATIONS    OF    THE    SECOND,    THIRD    AND    FOURTH 
DEGREES.    GROUP  OF   AN    EQUATION.    RESOLVENTS. 

§  148.     The  problem  of  the  algebraic  solution  of  the  equation 
of  the  second  degree 

1 )  x1 — crr  +  G2  =  0 

can  be  stated  in  the  following  terms:  From  the  elementary  sym- 
metric functions  cx  and  c,  of  the  roots  xt  and  x2  of  1)  it  is  required 
to  determine  the  two- valued  function  a;,  by  the  extraction  of  roots.* 
Now  it  is  already  known  to  us  (Chapter  I,  §  13)  that  there  is  always 
a  two-valued  function,  the  square  of  which,  viz.,  the  discriminant, 
is  single-valued.     In  the  present  case  we  have 

J  =  (a?,  —  x2f  =  (xx  +  x2)2 —  ±xxx.2  =  c,2  —  4r , . 
f^A  —  {xx  —  x2)  =\Zc}2 — 4c2. 
Since  there  is  only  one  family  of  two-valued  functions,  every  such 
function  can  be  rationally  expressed  in  terms  of   hj A.     For  the 
linear  two-valued  functions  we  have 

alXl  4-  a2x2  =  — _—  (a;,  +  x2)  -\ _- — fa— a*) 


and  in  particular,  for  a,  =  1,  a2  —  0,  and  for  a,  =  0,  a.2  =  1 


"2 — ci  ~r  — 2 —        '  2' 


•'i  =   S  +2-VC,2-  -4c2,    Xa=  -± —  %*/c?--4&2. 

*C-  G.  J.  Jacobi:  Observatiunculae  ad  theorlam  aequationum  pertincntes.  Werke, 
Vol.  Ill;  p.  2G9.  Also  J.  L.Lagrange:  Reflexions  but  la  resolution  algeorlque  des  equa- 
tions.   Oeuvres.  t.  III.p.  205. 


ELEMENTARY    CASES  —  GROUP    OF    AN    EQUATION RESOLVENTS.  169 

§  149.     In  the  case  of  the  equation  of  the  third  degree 

the  solution  requires  not  merely  the  determination  of  the  three- 
valued  function  cc, ,  but  that  of  the  three  three-valued  functions 
xu  ■>:, ,  .»■,.     With  these  the  3! -valued  function 

?  =  «1#1  +  «2  +  «:!■'•; 

is  also  known,  and  conversely  xx,x2,xz  can  be  rationally  expressed 
in  terms  of  r.  We  have  therefore  to  find  a  means  of  passing  from 
the  one- valued  functions  cuc2,cz  to  a  six-valued  function  by  the 
extraction  of  roots. 

In  the  first  place  the  square  root  of  the  discriminant 

J  =  (x1 —  oc2)'i(x1 — xz)2(x2 —  #3)"  =  — 27c32  +  18030^! — 4c3c,:f 

— 4co3  +  <"  ■' 
furnishes  the  two-valued  function 

±  \%i        X2)  (Xi        X3)  (.*'o        x3), 

in  terms  of  which  all  the  two-valued  functions  are  rationally  expres- 
sible. The  question  then  becomes  whether  there  is  any  multiple- 
valued  function  of  which  a  power  is  two -valued.  This  question  has 
already  been  answered  in  Chapter  III,  §  59.  The  six-valued  func- 
tion 

f—  l+V^^l 
9>i  =  «i  +  "'Xo  +  ojx3     10  —  ^ —     —J 

cm  being  raised  to  the  third  power,  gives 

<P*  =  i(2Cl3— 9c,c3  +  27c3  +  3  V~3J) 
=  1(^  +  3  V=:3J). 


again,  if  <p 2  is  obtained  from  <f ,  by  changing  the  sign  of   \/  —  3  > 
we  have 

92s  =  (a?i  +  «*£ca  +  o/2x3)  =  I  (5,  —  3  V  — 3J) . 

Accordingly 

a?,  +  w2a-2  +  wa-3  =  v  ^(^  +  3  V —  3  A , 
«i  +  "«a  -f-  w2a-3  =  V' i  (5,  —  3  V  — 3i. 

Combining  with  these  the  equation 

*^i    l~  Xo   \~ x>3  —  C|  , 


170  THEORY    OF    SUBSTITUTIONS. 

and  observing  that 

1  +  w  +  or  =  0, 

we  obtain  the  following  results 

•*'.  =  k  I  cx  +  %  \(St  +  3  \/~SJ  )  +  i/ 1(^,-3  V^Sl)]' 


.r,  =  I  [ Cl  +  w  V  | (flf,  +  3  V  —  3  J)  +  "-'  v/ 1  (5,-3  V  —  3  A)] , 
xa  =  :\  [  c,  +  r»a  V'  l(SI  +  3V=Sj+  w  ^1(5,  — 3\7==3J)1  • 
The  solution  of  the  equation  of  the  third  degree  is  then  complete. 
§  1 50.     In  the  case  of  the  equation  of  the  fourth  degree 

it  is  again  only  the  one-valued  functions  cuc2jc9,  c4  that  are  known. 
From  these  we  have  to  obtain  the  four  four- valued  functions 
xx,x2,x3,xi,   and  with  them  the  24- valued  function 

by  the  repeated  extraction  of  roots. 

In  the  first  place  the  square  root  of  a  rational  integral  function 
of  cl,c2,c3,ci  furnishes  the  two-valued  function  ^/j.  Again,  we 
have  met  in  §  59  with  a  six-valued  function 

<p  =  (xtx2  +  x3xt)  -\-  oj(x}x3  -f-  x2xt)  -(-  <u2(a?ia?4  -+-  x2x3) , 

the  third  power  of  which  is  two -valued  and  therefore  belongs  to  the 
family  of  ^  j .  We  can  therefore  obtain  <p  by  the  extraction  of  the 
cube  root  of  a  two-valued  function.  <p  being  determined,  every 
function  belonging  to  the  same  family  is  also  known.  The  group 
of  <f  is 

G  =  [l,  (x,x2)  (.'v.),  (.«-,.«■  ,i  (.',.'•,).  <.,-,.r,)  <.r...r:J)];      p  =  6,   r  =  4. 
To  this  same  group  belongs  the  function 

which  can  therefore  be  rationally  obtained  from  <p,  while  4',  which 

can  be  obtained  from  <f>2  by  extraction  of  a  square  root,  belongs  to 

the  group 

H=[l,(x1x2)(xaxt)']',    />  =  12,  r  =  2. 

<!'  may  therefore  be  regarded  as  known.     Finally 

■/  =  [«,(#,  —  x2)  +  <i,(r,  —  xt)J,     r  =  ft  (.r,  +  x2)  +  fi2(x3  +  xt) 


ELEMENTARY    CASES GROUP    OF    AN    EQUATION RESOLVENTS.  171 

can  be  rationally  expressed  in  terms  of  <p,  and  •/  is  a  24-valued 
function.  All  rational  functions  of  the  roots,  and  in  particular  the 
roots  themselves  can  then  be  rationally  expressed  in  terms  of  /. 
To  determine  the  roots  we  may,  for  example,  combine  the  four 
equations  for  •/  and  r  in  which  «,  =  ±  «2  and  ,?,  =  ±  /92 . 

§  151.  In  attempting  the  algebraic  solution  of  the  general 
equations  of  the  fifth  degree  by  the  same  method,  we  should  not  be 
able  to  proceed  further  than  the  construction  of  the  two-valued 
functions.  For  we  have  seen  in  §  58  that  for  more  than  four 
independent  quantities  there  is  no  multiple-valued  function  of 
which  a  power  is  two-valued.  It  is  still  a  question,  however,  whether 
the  solution  of  the  equation  fails  merely  through  a  defect  in  the 
method  or  whether  the  impossibility  of  an  algebraic  solution  resides 
in  the  nature  of  the  problem.  It  will  hereafter  be  shown  that  the 
latter  is  the  case.  We  shall  demonstrate  the  full  sufficiency  of  the 
method  by  the  proof  of  the  theorem  that  every  irrational  function  of 
the  coefficients  which  occurs  in  the  algebraic  solution  of  an  equation 
is  a  rational  function  of  the  roots.  All  the  steps  leading  from  the 
given  one-valued  function  to  the  required  » [-valued  functions  can 
therefore  be  taken  within  the  theory  of  the  integral  rational  func- 
tions of  the  roots. 

§  152.     We  turn  our  attention  next  to  the  accurate  formulation 
of  the  problem  involved  in  the  solution  of  algebraic  equations. 
Suppose  that  all  the  roots  of  an  equation  of  the  nth  degree 

1)  f(x)  =  0 

are  to  be  determined.  If  one  of  them  a^  is  known,  the  problem  is 
only  partially  solved.  By  the  aid  of  the  partial  solution  we  can 
however  reduce  the  problem  and  regard  it  now  as  requiring  not 
the  determination  of  the  n  —  1  remaining  roots  of  the  equation  of 
the  nth  degree  f(x)  =  0,  but  that  of  all  the  n —  1  roots  of  the 
reduced  equation 

We  have  then  still  to  accomplish  the  solution  of  2).  If  one  of  its 
roots  aSg  is  known,  we  can  reduce  the  problem  still  further  to  that  of 
the  determination  of  the  n  —  2  roots  of  the  equation 


172 


THEORY    OF    SUBSTITUTIONS. 


*V       '  *Cq 

Proceeding  in  this  way  we  arrive  finally  at  an  equation  of  the  first 
degree. 

It  appears  therefore  that  solution  of  an  equation  of  the  //"' 
degree  involves  a  series  of  problems.  All  of  these  problems  are 
however  included  in  a  single  one,  that  of  the  determination  of  a 
single  root  of  a  certain  equation  of  degree  u\ 

Thus,  if  the  entirely  independent  roots  ,r, ,  r_, ,  .  .  .  x„  of  the 
equation  1)  are  known,  then  the  w!- valued  function  with  arbitrary 
constants  a: ,  a. a„ 

4)  '=  —  a{x,  +  a.,j-,  -f  .  .  .  +  anxn 

is  also  known.     Conversely  if  I  is  known,  every  root  of  the  equa- 
tion 1 )  is  known,  for  every  rational  integral  junction  of  x11xi,...xn 
can  be  rationally  expressed  in  terms  of  the  n\- valued  function  I. 
The  function  ?  satisfies  an  equation  of  degree  n\ 

5)  /-'I-,       z»'—A1?',-1  +  ...±AHl=(Z— *,)(*— ?2)- (£-£.,)  =0, 

the  coefficients  of  which  are  rational  integral  functions  of  those  of 
1)  and  of  '/,,  <'■,,.  .  .  .  an.  This  equation  is,  in  distinction  from  1), 
a  very  special  one.  For  its  roots  are  no  longer  independent,  as  was 
the  case  with  1),  but  every  one  of  them  is  a  rational  function  of 
every  other,  since  all  the  values  ?,,£2,  .  .  .  !„,  belong  to  the  group  1 
with  respect  to  #,,  x2,  .  .  .  xn.  The  solution  of  5),  and  consequently 
that  of  1)  is  therefore  complete,  as  soon  as  a  single  root  of  the 
former  is  known. 

The  equation  ^(^  =  0  is  called  the  resolvent  equation,  and  I 
the  Galois  resolvent  of  1).  We  shall  presently  introduce  the 
name  "resolvent"  in  a  more  extended  sense. 

£  153.  If  the  coefficients  c,,  e.,,  .  .  .  c„  of  the  equation  1)  are 
entirely  independent,  the  Galois  resolvent  cannot  break  up  into 
rational  factors.  Conversely,  if  the  Galois  resolvent  does  not  break 
up  into  factors,  then,  although  relations  may  exist  among  the  coef- 
ficients r,  they  are  not  of  such  a  nature  as  to  produce  any  simplifi- 
cation in  the  form  of  the  solution.  From  this  point  of  view  the 
equation  1)  is  in  this  case  a  general  equation,  or,  according  to  Kron 
ecker,  it  has  no  affect. 


ELEMENTAKV    CASES      -  GROUP    OF    AN    EQUATION  —  RESOLVENTS.         1  73 

On  the  other  hand,  if  for  particular  values  of  the  coefficient 
the  Galois  resolvent  F(z)  breaks  up  into  irreducible  factors  with 
rational  coefficients 

0)  F(S)      F, (£)(*», (£)...  F'(*\ 

then  the  unsyrnmetric  functions  /<',(/).  which  in  the  case  of  fully 
independent  coefficients  are  irrational,  are  now  rationally  known. 
The  equation  1)  is  then  a  special  equation,  or  according  to  Kron- 
ecker.  an  affect  equation.  The  affect  of  an  equation  lies,  then,  in  the 
manner  in  which  the  Galois  resolvent  breaks  up  or,  again,  in  the 
fact  that,  as  a  result  of  particular  relations  among  the  coefficients 
(\.e...  .  .  .  c„  or  the  roots  .c, .  .<•_,,  .  .  .  .<•„.  certain  unsyrnmetric  irreduci- 
ble functions  F:{E)  are  rationally  known.  The  determination  of  that 
which  is  to  be  regarded  as  rationally  known  in  any  case  is  obviously 
of  the  greatest  importance.  As  a  result  of  any  change  in  this 
respect,  an  equation  may  gain  or  lose  an  affect. 

If  the  group  belonging  to  any  one  of  the  functions  F;('E)  is  a  . 
then  every  function  belonging  to  Gt  is  rationally  known,  being  a 
rational  function  of  Ft.  It  is  readily  seen  that  the  groups  Gt  all  coin- 
cide. For  if  the  subgroup  common  to  them  all  is  /'.  then  the  ration- 
ally known  function  '//<',  -f  j3F2  4-  .  .  .  +/  F„  belongs  to  /',  and  Conse- 
quently every  function  belonging  to  /'is  rationally  known.  Accord- 
ingly the  factor  of  F,  which  proceeds  from  the  application  of  the 
substitutions  of  /'  alone  to  any  linear  factor  S  —  o.rt^  "_■',.,... —  "■„■''„ 
of  F;  is  itself  rationally  known.  This  is  inconsistent  with  the 
assumed  irreducibility  of   F,,  unless  /'=  Gt  =  G2  =  .  .  .  =  Gv. 

All  the  functions  Fn  F,,  .  .  .  F„  therefore  belong  to  the  same 
family,  and  this  is  characterized  by  a  certain  group  G  or  by  any 
function  $(xx,  ■>:,.  .  .  .  .r,)  belonging  to  G.  Every  function  belong- 
ing to  G  is  rationally  known  and  conversely  every  rationally  known 
function  belongs  to  G. 

Theorem  I.  Every  special  or  affect  equation  is  character- 
ized by  a  group  G,  or  l>y  a  single  relation  between  the  roots 

'/'(a\,x,,  .  .  .  .»■„)  =  0. 

The  group  (t  is  called  the   Galois  group  of  the  equation.      Ever)/ 
equation  is  accordingly  completely  defined  by  the  system 

—  C\  —  ('\  j       —X\Xn  —  o_. ,  .  .  .  ;        "  {Xl  ,  X2 ,  .  .  .  JC„)  :=  ( '. 

*  ('f.  Kronecker;  Grundziige  einer  aritlnnetischen  Theorie  der  algebraischen Gros- 
ser), S§  10, 11. 


174  THEORY    OF     SUBSTITUTIONS. 

For  example,  given  a  quadratic  equation 

x2 — dx-\-c2  =  0. 

the  corresponding  Galois  resolvent  is 

5"  _.  2(«,  +  ajcf  +  (a,  —  «2)2c2  +  4  W,8  =  0. 

In  general  the  latter  equation  is  irreducible,  and  the  quadratic  equa- 
tion has  no  affect.     But,  if  we  take 

2cl  =  m-\-n,     c.2  —  mn, 
the  equation  in  I  becomes 

(r   ~axm  —  «2n)(^ — ain  —  a2m)=  0  =(•? — a1xl —  a2x.2)(:-      «,#<> —  «2iC,) 
and  the  given  quadratic  equation  has  an  affect. 
Again,  if  c,  —  c2  =  0,  we  have 

( :  —  ttjCj  —  o.2c.,y  —  0  =  (I  —  avT\  —  a2a?a )  ( -  —  «iiCa  —  a-"Tl  )• 

But  if  c,  —  2c,2  =  0,  we  obtain 

,-2— 2(«,  +  «,)  c,l  +  2  (a,2  +  «,2)Cl2  =  0, 

and  this  equation  has  no  affect,  so  long  as  we  deal  only  with  real 
quantities.  If  however  we  regard  i  =  \/  -  - 1  as  known,  the  equa- 
tion h#s  an  affect,  for  the  Galois  resolvent  then  becomes 

(f  —  (a,  -+■  aj)  c,  +  («,  —  a2)  C,t)  (I —  («!  +  «2)  C,  —  (a,  —  a2)  c,i)  =  0. 

§  154.  It  is  clear  that  every  unsymmetric  equation  <p  (.r, ,  .  .  .  r,  | 
=  0  between  the  roots  produces  an  affect.  On  the  other  hand  an 
equation  between  the  cofficients  'f''(cn  c.,,  .  .  .  c„)  =  0  produces  an 
affect  only  when,  as  a  result,  the  Galois  resolvent  breaks  up  into 
rational  factors.  This  is  always  the  case  if  '/''  is  the  product  of  all 
the  conjugate  values  of  an  unsymmetric  function, 

V(r,,rJ,...c„)=//</M.r|.,- ,;,)■ 

for  it  follows  then  from  §  2  that  one  of  the  factors  of  the  product 
must  vanish.  Whether  this  condition  is  also  necessary,  is  a  ques- 
tion which  we  will  not  here  consider. 

A  special  equation  might  also  be  characterized  by  several  rela- 
tions between  the  roots  or  the  cofficients  or  both.  A  direct  consid- 
eration of  the  latter  cases  would  again  present  serious  difficulty. 
From  the  preceding  Section  we  recognize,  however,  that  whatever 
the  number  or  the  character  of  the  relations  may  be,  if  they  pro- 


ELEMENTARY    CASES — GROUP    OP    AN    EQUATION RESOLVENTS.         175 

duce   an  affect,    they   can    all   be   replaced   by  a   single  equation 

§  155.  We  will  illustrate  the  ideas  and  definitions  introduced 
in  the  preceding  Sections  by  an  example. 

Suppose  that  all  the  roots  of  an  irreducible  equation  f(x)  =  0 
are  rational  functions  of  a  single  one  among  them 

The  two  equations 

/(*)  =  o,  /!>*(*)] = o 

have  then  one  root,  a?, ,  in  common,  and  since  f(x)  is  irreducible, 
all  the  other  roots  x., ,  .r:! ,  .  .  .  x„  of  the  first  equation  are  also  roots 
of  the  second.     Consequently  f(x)  =  0  is  satisfied  by 

<P*M,  Px(a73),  . .  .  <Pk(x„), 
and  in  general  by  every 

9a[Mxi)]     («,/5=  2,  3,  .  .  .n). 
Again 

for  otherwise  the  two  equations 

f(x)  =  0,     <pa  (x)  —  <pb  (x)  =  0 

would  have  the  root  <py{x^)  and  consequently  all  the  roots  of  fix)  =  0 
in  common.  It  would  then  follow  that  <pa(^i)  =  <fp(xi),  h  «•?  two 
of  the  roots  of  f(x)  would  be  equal.  This  being  contrary  to 
assumption,  it  appears  that  the  series 

R,)  Xy,        <f2(Xy),    <pS(Xy)     .     .     .     <P„{Xy) 

coincides,  apart  from  the  order  of  the  elements,  with  the  series 
R.)  <r, ,  <f>{xx),  <f3(xi),  ■  ■  ■  ?»Oi)- 

We  determine  now  what  substitutions  can  be  performed  among 
the  roots  .r,,  .r._,,  .  .  .  .*■„  without  disturbing  the  relations  existing 
among  them.  If  such  a  substitution  replaces  xx  by  xy  then  it 
must  also  replace  every  xa  by  ^a(^Y)-  ^ne  substitution  is  there- 
fore fully  determined  by  the  single  sequence  xx,xy.  There  are 
accordingly  only  n  substitutions  which  satisfy  the  conditions.  These 
form  a  group  £  (§  129);  for  the  system  is  transitive  and  its  degree 
and  order  are  both  equal  to  n. 


1  <<>  THEORY    OF    SUBSTITUTIONS. 

This  group  !-'  is  the  group  of  the  given  equation.  For  the  rela- 
tions which  characterize  the  given  equations  are  equivalent  to  the 

single  relation 

and  if  this  function  <1>  is  to  remain  unaltered,  then  when  .r,  is 
replaced  by  xy,  every  .r0  must  be  replaced  by  <pa(xy)  =  9*[_9y{X\j]  > 
exactly  as  under  the  application  of  the  substitutions  of  Q. 

£  156.  Without  entering  further  into  the  theory  of  the  group 
of  an  equation  we  can  still  give  here  two  of  the  most  important 
theorems. 

Theorem  II.  The  group  of  an  irreducible  equation  is 
transitive.     Conversely,  if  the  group  of  an  equation  is  transitive, 

the  equation  is  irreducible. 

Thus  if  the  group  G  of  the  equation 

./'(.'•)      (x     a?,)  (a      .<•,)  ...<.»•  --.<•„)  =  0 

is  intransitive,  suppose  that  it  connects  only  the  elements  a*, .  x, »„ 

with  one  another.     Then  the  function 

<P  —  (x — a?,)  (■■      .--.)  .  .  .  (x—  xa) 

is  unchanged  by  G,  and  consequently  belongs  either  to  the  family 
of  G  or  to  one  of  its  sub- families.  In  either  case  f  is  rationally 
known,  that  is,  the  coefficients  of  <p  are  rational  functions  of  known 
quantities,  so  that  <p(x)  is  a  rational  factor  of  /(a?). 

Conversely,  if  f(x)  is  reducible,  a  factor  y>(x)  of  the  above 
form  will  be  rationally  known,  and  G  can  contain  no  substitution 
which  replaces  any  element  xlfx2,  ■  ■  xa  by  xa  ,,  for  otherwise 
the  rationally  known  function  c  would  not  remain  unchanged  for 
all  the  substitutions  of   G.     Consequently  G  is  intransitive. 

Theorem    III.     If  all  the  roots  of  an  irreducible  equation 

are  rational  functions  of  any  one  among  them,  the  order  of  the 
group  of  lh"  equation  is  u.  Conversely,  if  the  group  of  an  equa- 
tion  is  transitive,  and  if  its  order  and  degree,  are  eijual.  then  all 
the  roots  of  the  equation  are  rational  functions  of  any  one  among 
Hum. 

The  lirst  part  of  the  theorem  follows  at  once  from  $  155.    We 
proceed  to  prove  the  second  part. 


ELEMENTARY    CASES  —  GROUP    OF    AN    EQUATION RESOLVENTS.  177 

From  the  transitivity  of  the  group  follows  the  irreducibility  of 
the  equation. 

If  we  specialize  the  given  equation  by  adjoining  to  it  the  family 
belonging  to  .r, ,  the  group  will  be  correspondingly  reduced.  It 
will  in  fact  then  contain  only  substitutions  which  leave  x,  un- 
changed. But  as  the  group  is  of  the  type  11  (§  129),  it  contains  only 
one  substitution,  identity,  which  leave  xl  unchanged.  Accordingly 
after  the  adjunction  of  as, ,  all  functions  belonging  to  the  group  1 
or  to  any  larger  group  are  rationally  known.  In  particular 
.<•,,  .r,,  .  .  .  x„  are  rationally  known,  i.  e.,  they  are  rational  functions 

of  xx. 

From  this   follows  again  the  theorem  which  has  already  been 

proved  in  §  155: 

Theorem  VI.  If  all  the  roots  of  an  irreducible  equation 
are  rational  functions  of  any  one  among  them,  they  are  rational 
functions  of  every  one  among  them. 

§  157.  From  Theorem  III,  the  group  of  the  Galois  resolvent 
equation  of  a  general  equation  is  of  order  n!  To  obtain  it,  we 
apply  to  the  values 

~\i  *2J    •  •  •  '*! 

all  the  substitutions  of  .r, ,  .v,,  .  .  .  x„  and  regard  the  resulting  rear- 
rangements as  substitutions  of  the  ?'s .  Since  every  substitution  of 
the  .r's  affects  all  of  the  r's,  the  group  of  the  £'s  belongs  to  the 
groups  £.  The  group  of  the  .r's  and  that  of  the  r's  are  simply 
isomorphic  (§  72). 

For  an  example  we  may  take  again  the  case  of  the  equation  of 
the  third  degree.  The  groups  G  of  f(x)  =  0  and  /'  of  F  (r)  =  0  are 
then 

G=[l,  f.<yr,|.  (.,■,.<,).  I  ..-_..<•.).  ,.-><■■•<•,).  (./',..-,.•.)  | 

r=\_l,  (fj?3)  (?2**)  (^e)j  <-ri"h)  (-J-j)  (~:i~+K  Kl-"j)  ("3-5/  (~4-fi)i 

Ul"|--,»  I  -  _'~3~tt)'  (rir.-.~4>  ("-.'-h^sjj- 

If  however,  the  given   equation  is   an  affect  equation    with    a 

group  G  of  order  r,  then  of  the  n !  substitutions  among  the  r's  only 

those  are  to  be  retained  which  connect  any  =■,   with  those  r's  which 

together  with   r;  belong  to    one  of  thp  rational  irreducible   factors 

F,(c)  of  F{=). 
12 


178  THEOKY    OF    SUBSTITUTIONS. 

i>  1  r>S.  We  apply  the  name  resolvent  generally  to  every  //-val- 
ued   function   cm .»•,,.<■, «■„)    of  the    roots    of    a   given    equation 

f{x)  =  0.  The  equation  of  the  ,""'  degree  which  is  satisfied  by  <f 
and  its  conjugate  values  is  called  a  resolvent  equation  This  desig- 
nation is  appropriate,  in  that  the  solution  of  a  resolvent  equation 
reduces  the  problem  of  the  solution  of  the  given  equation.  Thus, 
for  example,  in  the  case  of  the  equation  of  the  fourth  degree,  we 
employed  the  following  system  of  resolvents  (§  150): 

1 )  The    2- valued  function     V  J  =  {xl  —  xA  {xx  —  £C3)  .  .  .  (u-3  —  xt), 

2)  The    0- valued  function         <s  =  (a^o  +  .c3.r4)  +  «>  (a v  +  •''  ■' ',' 

+  w-(a-,a-4  +  x2x3), 

3)  The  12- valued  function         </■  =  (.r,.r,,- -  x3x4)  (xiX3-\- x2x4), 

4)  The  24  valued  function         /  =  ai{xl  —  x.2)  -\-  a2(x3 — x4). 

Originally  the  group  of  the  equation  was  of  order  24.  After 
the  solution  of  the  quadratic  equation  of  which  the  two-valued 
function  V  J  was  a  root,  the  general,  symmetric  group  reduced  to 
the  alternating  group  of  12  substitutions.  The  extraction  of 
a  cube  root  led  then  to  the  group  G  (§150)  of  order  4;  another 
square  root  to  the  group  H  of  order  2;  and  finally  we  arrived  at 
the  group  1,  and  the  solution  of  the  equation  was  complete,  the 
function  ~  being  superfluous. 

The  above  reduction  of  the  group  of  an  equation  to  its  //th  part 
by  the  solution  of  a  resolvent  equation  of  degree  /'  is  exceptional. 
For  general  equations  and  resolvents  this  reduction  is  not  possible. 
We  shall  see  later  that  it  is  possible  for  the  biquadratic  equation 
and  the  particular  series  of  resolvents  employed  above  only  because 
the  family  of  every  resolvent  was  a  self- conjugate  subfamily  of 
that  of  the  succeeding  one. 

§  159.  Given  any  /'-valued  resolvent  cr(o,,.r,,  .  .  ..»•„),  this  sat- 
isfies an  equation  of  the  />tb  degree 

if    ■  Al<ff-'i -\-  A.cp  ...±AP  =  0. 

To  determine  the  group  of  this  equation  we  adopt  the  same  method 
as  in  the  preceding  Section.     Suppose  that 

Vi  >  ^  ■>'  ■  •  ■  fp 
are  the  /'-values  of  </.     Every  substitution  of  the  group  G  of  the 


ELEMENTARY    CASES GROUP    OF    AN    EQUATION RESOLVENTS.         179 

equation  f(x)=0  produces  a  corresponding  substitution  of  these 
fj  values.  The  latter  substitutions  form  the  required  group  of  the 
resolvent  equation  for  tp.  This  group  is  isomorphic  to  (},  and  it  is 
transitive,  since  G  contains  substitutions  which  replace  cr,  by  every 
<pK.  If,  in  particular,  the  group  of  <px  is  a  self -conjugate  subgroup 
of  G,  then  it  is  also  the  group  of  <r2,  c\,,  .  .  .  <fp.  The  latter  values 
are  therefore  all  rational  functions  of  p,,  and  the  group  of  the 
resolvent  equation  is  a  group  £2,  as  in  §  156. 

§  160.  Following  the  example  of  Lagrange  *  we  might  attempt 
to  accomplish  the  reduction  and  possibly  the  solution  of  the  general 
Galois  resolvent  equation  F{=)  —  0  by  employing  particular  resolv- 
ents. It  will,  however,  appear  later  that  this  method  cannot  suc- 
ceed in  general  for  equations  of  a  degree  higher  than  the  fourth. 

*Mem.  d.  Berl.  Akad.   Ill;  and  Oeuvres  III,  p.  305  IT. 


CHAPTER  X 


THE    CYCLOTOMIC    EQUATIONS. 

§  161.  The  equation  which  is  satisfied  by  a  primitive  pUl  root 
of  unity  at,  (p,  as  usual,  always  denoting  a  prime  number),  is  called 
the  cyclotomic  equation.     It  is  of  the  form 

1)  ?—l  =  .r»    '+^-2+  .  ..  +^'2  +  ^  +  l=0, 

x  —  1 

and  its  p —  1  roots  are 


.2    ...3  ..  p-l 


m,  to  .  io    ...   tn 


2) 

We  prove  that  the  left  member  of  1 )  cannot  be  expressed  as  a  pro- 
duct of  two  integral  functions  fp(x)  and  c'(.r)  with  integral  coffi- 
cients.     For  if  this  were  the  case,  we  should  have  for  x  =  1 

Ki)>(i)=P, 

and  consequently  one  of  the  two  integral  factors,  for  example  c(l), 
must  be  equal  to  ±  1.  Moreover,  since  <p  (x)  =  0  has  at  least  one 
root  in  common  with  1),  at  least  one  of  the  expression  cr(«>a)  must 
vanish.     Consequently 

p(a,1)9(u>*)<p(a,*)...<p(a>1*-1)=0 

where  a>,  may  be  any  root  of  1),  since  the  series  2)  is  identical  with 
the  series  <t>i,iOi,to*,  ■  •  ■  "V    '•     The  equation 

9{x)  <p(tf)  v(xs)  . . .  y(x*    l)  =  0 

has  therefore  all  the  quantities  2)  as  roots.  Consequently  the  left 
member  of  this  equation  is  divisible  by  1).     Suppose  that 

?>)       ci.ncM./-)  .  .  .  en-"    l)=F(x)(xp-1+x*    -+...+.r+l), 

where  F(x)  is  an  integral  function  with  integral  coefficients.  From 
3 1  we  have  for  .<•  =  1 

IX1)]*-'  =P  /''<!), 

and  therefore  |  <s(  ] )  \''  '.  which  is  equal  to  1,  must  be  divisible  by  p. 
Accordingly  1)  is  not  reducible. 


THE    CYCLOTOMIC    EQUATIONS.  181 

Theorem    I.      The  eyclotomic  equation  for  the  priwn   num- 
ber /j 

I 


je 
is  irreducible. 


X*     "  +  .r"    2+  ...  +X-  +  1 


§  102.     If  now  g  is  a  primitive  root  (mod.  p),  then  the  series  2) 
of  the  roots  of  the  eyclotomic  equation  can  be  written 

4)  to9,  to8*,  i»''"'  .  .  .  a>»*~1. 

Since  I)  is  irreducible,  the  corresponding  group  is  transitive.  There 
is  therefore  a  substitution  present  which  replaces  ut9  by  or1'.  Then 
every  «jya  is  replaced  by 

((o9)9a  =  w9'l+\ 

and  the  substitution  is  therefore 

s  =  (w9  oj9"-  w9' .  .  .  uj9P~'1). 

The  p —  1  powers  of  s  form  the  group  of  1 ).  For  they  all  occur  in 
this  group,  and  from  §  156  the  group  contains  only  p  -1  substitu- 
tions in  all. 

We  form  now  the  cyclical  resolvent 

(a>  +  au>9+a2a>9*-\-  .  .  .  -p-a*-2^*-2)*-1, 

in  which  a  denotes  a  primitive  root  of  the  equation 

For  brevity  we  write  with  Jacobi 

0,8°  _|_  am9'  +  a2uj9"  +  .  .  .  +  a»~  V^~'  =  («,  ai). 

From  §  129  the  resolvent  («,  uj)p~  i  is  unchanged  by  s  and  its  pow- 
ers, that  is,  by  the  group  of  the  equation.  It  can  therefore  be 
expressed  as  a  rational  function  of  a  and  the  coefficients  of  1). 

If  we  denote  a  (p  —  l)th  root  of  this  rationally  known  quantity 
by  ~,  we  have 

5)  (a,  «)=T,. 

The  quantity  r,  is  a  (p  —  1)- valued  function  of  the  roots  of  1 ).  It 
is  changed  by  every  substitution  of  the  group,  for  the  substitution 
s  converts  it  into 

(a,  id9)  =  a~l(a,  at)  =  a~  1t1. 


182  THEORY    OF    SUBSTITUTIONS. 

It  follows  from  the  general  theory  of  groups  that  every  function 
of  the  roots  can  be  rationally  expressed  in  terms  of  r, .  We  will 
however  give  a  special  investigation  for  this  particular  case.  The 
group  of  the  cyclotomic  equation  leaves  the  value  of 

6)  (oA,  to)  (a,  o»)*-1_A 

unchanged;  for  the  effect  of  the  substitution  *.-  is  to  convert  this 
function  into 

=  (aA,  w)  (a,  to)*-1-* 

i.  e.,  into  itself.  If  now  we  denote  the  rationally  known  value  6)  by 
TA,  where  in  particular  ~lp^1  =  T, ,  we  obtain  for  /  =  1,  2,  .  .  .  p —  2, 
the  following  series  of  equations: 

(«»  =  *,,  («?■,•)  =  ^V,    («>)  =  |^.. :(«*->)  =^t*->. 

Combining  with  these  the  obvious  relation  among  the  roots  and  the 
coefficients  of   1) 

(1,")  =  -1, 
we  obtain  by  proper  linear  combinations 

It  is  evident  that  a  change  in  the  choice  of  the  particular  root  a 

p— i  _ 

or  of  the  particular  value  of  r,  =  \/  T,  only  interchanges  the  val- 
in'   w  among  themselves. 

Theorem  II.  The  solution  of  the  cyclotomic  equation  for 
the  prime  number  p  requires  only  the  determination  of  a  primitive 
root  of  the  equation  zp'1  — 1  =  0,  and  the  extraction  of  the 
(p  —  l)'h  root  of  an  expression  which  is  then  rationally  knoum. 
The  cyclotomic  equation  therefore  reduces  to  two  binomial  equa- 
tions of  degree  p  —  1. 


THE    CYCLOTOMIC    EQUATIONS.  183 

§  163.     The  second  of  these  operations  can  be  still  further  sim- 
plified.    The  quantity  71,  is  in  general  complex  and  of  the  form 

Since  now  (a,  id)1'-1  and  («  _1,  w  ')''  '  are  conjugate  values,  it  fol- 
lows that 

(a, u>)p-l(a~\  w-1)-''-1  =  p (cos  ft  -\-isin&)p(co8& —  i sin ft)  =  //"'. 

Again  it  can  be  shown,  exactly  as  in  the  preceding  Section,  that 

(a,iu)  (a-1,."""1) 

belongs  to  the  group  of  the  cyclotomic  equation  and  is  conse- 
quently a  rational  function  of  a  and  of  the  coefficients  of  1).  If 
we  denote  its  value  by  U  we  have 

V  p  =  v  u. 

Accordingly  for  any  integral  value  of  A; 

r       0-f-2*7T  ,    .    .    ft  +  2k-\ 

(a.  u) )  =  v  U  I  cos  -      —z — \- 1  sin —  I 

v         p — 1  p — 1    J. 

Since  U  and  ft  are  both  known,  we  have  then 

Theorem  III.  The  solution  of  the  cyclotomic  equation 
requires  the  determination  of  a  primitive  root  of  the  equation 
zp~1  —  1  =0,  the  division  into  p  —  1  equal  parts  of  an  angle  which 
is  then  known,  and  the  extraction  of  the  square  root  of  a  knoivn 
quantity. 

The  latter  quantity,  U,  is  readily  calculated.     We  have 

U=  (u>  +  a  to*  -+-  o2w""-  +  .  .  .  +  a*-aai«rl>-a). 

(<U-1-f-a-1w-«,  +  a-2ttf-»  +  .  .  .  +a-*+*a>-<>p-v). 

To  reduce  this  product  we  begin  by  multiplying  each  pair  of  cor- 
responding terms  of  the  two  parentheses  together.     The  result  is 

1+1  +  1+.- .+1  =p-l. 

Again,  if  we  multiply  every  term  of  the  first  parenthesis  by  the 
kth  term  to  the  right  of  the  corresponding  term  in  the  second  par- 
enthesis, we  obtain 

K)  a-*(a»-'*+,  +  e»--»*+1+'  +  a»-'*+r+'*  +  .  .  .). 

Now  w^ffk  +  1  is  a  i»tb  root  of  unity  <«,  different  from  1;  for  if 


184  THEORY    OF    SUBSTITUTIONS. 

then    -0*+1e=O,  </    ~1    (mod.  p),    i.    e.,   k  =  0   or  p-   1.     The 
quantity  K)  is  therefore  equal  to 

a    *  (Wj  _j_  Wir/  _|_  mf  _|_  -  ,  _  ^    • ■ ,  _  _  a-fc 

and  consequently 

r7  =  p_i_(a-i  +  «-2+>>-+    -*+2)=p_1_(_1) 
=  p 

Theorem  IV.  The  quantity  of  Theorem  Til,  of  which  the 
square  root  is  to  be  extracted,  has  the  value  p. 

§164.  The  resolvent  5)  was  (p  —  1  (valued,  and  consequently 
the  preceding  method  furnished  at  once  the  complete  solution  of 
the  cyclotomic  equation.  By  the  aid  of  resolvents  with  smaller 
numbers  of  values,  the  solution  of  the  equation  can  be  divided  into 
its  simplest  component  operations. 

Suppose  that  px  is  a  prime  factor  of  p  —  1,  and  that  p — 1  =plq] . 
We  form  then  thr  resolvent 

(a)  -j-  «,a»»  +  a,  V'2  -f  .  .  .  +  a*    -or'1'     '-)"., 

where  a,  is  a  primitive  root  of  the  equation 

Sl>i_l  =  0. 

The  values  </,,  /,',  .  .  .  axl'\  are  all  different,  and  the  higher  powers  of 
'/,  take  the  same  values  again.     It  follows  that,  if 


c„        =  U) 


-|_<y»*l  +W»2*1  -}-...  -|- a* (*l       '">. 

cr,  =  or'  -f  (0**1  +  '    -f  <o-i'2"i   'r  '  +  .  .  .    -f  <•/■>  <''•  -   ')*|        . 

the  resolvent  above  can  be  written 

( <Po  +  ai9>i  +  aiVa  +  .  .  .  +  «i*»    '  ?„  -  - 1)*1, 
or,  again  in  Jacobi's  notation, 

By  the  same  method  as  before  we  can  show  that  this  resolvent 
is  unchanged  if  ">  is  replaced  by  <»'■',  that  is,  that  it  belongs  to  the 
group  of  1)  and  is  consequently  a  rational  function  of  a,  and  of  the 


THE    CYCLOTOMIC    EQUATIONS.  185 

coefficients  of  1).     We  denote  its    value   by   A',  =  >,''i,    and   have 
accordingly 

("i ,  <p)  -  *i  • 
If  then  wo  write  precisely  as  before, 

it  appears  that  N\  is  rationally  known,  and  that 


These  several  functions  are  all  unchanged  if  o>  is  replaced  by  <"     . 
that  is.  they  are  unchanged  by  the  subgroup 

s'\  n-''i.  S:,"i,   .  .  .  8*1*1. 

We  have  therefore 

Theorem  V.  The  px-valued  resolvents  <p0,  <pt, .  . .  0^.  ,  of 
the  cyclotomic  equation  belong  to  the  group  fanned  by  the  powers 
of  *''<.  They  can  be  obtained  by  determining  a  primitive  raal 
of  j  - 1  =  0  and  extracting  the  /),"'  root  of  a  quantity  which  is 
then  rationally  known. 

If  p,  is  a  second  prime  factor  of  //  1.  and  if  p— 1  —jhl':'h- 
then  the  resolvent 

in  which  « ,  is  a  primitive  p}h  root  of  unity,  is  reducible  to  the  form 

where 

*  =  •  +  •«+»•**+..., 


This  resolvent  is  unchanged  if  o  is  replaced  by  w  "■"■,  that  is,  it 
is   unchanged  by   the  substitutions    s^i ,  S2*!  .  .  .       Consequently    it 
12a 


186  THEORY    OF    SUBSTITUTIONS. 

can  be  rationally  expressed  in  terms  of  c„.  if  </  is  regarded  as 
known.     Again  if  we  write 

then  M\  is  also  a  rational  function  of  <s„,  and  we  have 

^-jX~n+ai  *+*  **  +  ■•  J, 

Theorem  VI.  T/ie  pxp.2-valued  resolvents  /,,,/,,  .  .  •/,,,,,,  i 
o/  £/?e  cyclotomic  equation  belong  to  the  group  formed  by  the  pow- 
ers of  n''7'-.  They  can  be  obtained  l>y  determining  a  primitive  root 
of  z  -1  =  0  and  extracting  a  p.,"'  root  of  a  quantity  which  is 
rational  in  this  primitive  root  and  in  <r„. 

§  165.     By  continuing  the  same  process  we  have  finally 

Theorem  VIJ.  If  p — l=PiPiPs-  . . ,  the  solution  of  the 
cyclotomic  equation  for  the  prime  number  p  requires  the  determina- 
tion of  a  primitive  root  of  each  of  the  equations 

z*.— 1=0,  z*«— 1  =  0,  z"s  -1  =  0,... 

and  tin'  extraction  successively  of  the  p*, p*,  p*,  .  . .  roots  of 
expressions  each  of  which  is  rationally  known  in  terms  of  the  pre- 
ceding known  quantities. 

If  ¥>o  is  given,  <fi,<p2,  ■  •  ■  <fin —  1  are  rationally  known,  since  they 
all  belong  to  the  same  group.     Similarly  the  coefficients  of 

'    {x—  w)  (x—to°p<)  (x—o^) .-. .  (*_,„""'>-"">)  =  0, 

7)  I       (X  —  W)  (X  —  <0°P1  +1)  (x  —  o^>':  i  ')  .  .  .  (X  —  W«<*      '"''  +')  =  0  , 

are  all  rationally  known.  Accordingly  after  the  process  of  Theo- 
rem V  has  been  carried  out,  the  equation  1)  breaks  up  into  p,  fac- 
tors 7).  Since  the  group  belonging  to  each  of  these  new  equations 
is  transitive  in  the  corresponding  roots,  the  factors  1)  are  again  all 
irreducible,  so  long  as  only  the  coefficients  of  1)  and  <pv  are  known. 


THE    CYCLOTOMIC    EQUATIONS. 


187 


Again,  after  the  process  of  Theorem  VI  has  been  carried  out, 
/,,  is  known.  All  the  values  of  this  function  belong  to  the  same 
group  and  they  are  therefore  all  rational  functions  of  ■/„.  Similarly 
the  coefficients  of 

(x  -  w)  (x-^a>»*p*)  («—«.•*>*)  .  .  .  {x— m'to-1***)  =  0 


8) 


are  rationally  known.  The  equations  7)  are  therefore  now  reduci- 
ble, and  each  of  them  resolves  into  p2  factors  8),  which  are  again 
irreducible  within  the  domain  defined  by  /,,.  We  can  proceed  in 
this  way  until  we  arrive  at  equations  of  the  first  degree. 

§  166.  The  particular  case  for  which  the  prime  factors  of  p —  1 
are  all  equal  to  2  is  of  especial  interest. 

Theorem  VIII.  //  2'"  +  1  is  a  prime  number  p,  the  cyclo- 
tomic  equation  belonging  to  p  can  be  solved  by  means  of  a  series 
of  m  quadratic  equations.  In  this  case  the  regular  polygon  of 
p  =  2"'  + 1  sides  can  be  constructed  by  means  of  ruler  and  compass. 

In  fact,  for  one  root  of  the  cyclotomic  equation  we  have 

2-  ,    .  .    2-         _,  2-      .   .    2tt 

io  =  cos \-ism — ,  =  cos ism  — , 

P  P  P  P 

.       2- 
u)-\-  o>     '  =  2  cos  — , 

p 

2- 
and  consequently  the  angle  :  u  can  be  constructed  with  ruler  and 

compass. 

In  order  that  2'"  + 1  may  be  a  prime  number,  it  is  necessary  that 

m  =  2*.    For  if  m  =  2'tm1 ,  where  m,  is  odd,  then  2"'  +  1  =  (22M)'"1+ 1 

would  be  divisible  by  2    -j-  1.     If 

#       fi  =  U,  1,  2,  3,  4, 
the  values  of  p  are  actually  prime  numbers 

p  =  3,  5,  17,  257,  65537, 

and  in  these  cases  the  corresponding  regular  polygons  can  there- 
fore be  constructed.      But  for  ,«  =  5  we  have 

2^  + 1  =  4294967297  =  641  •  6700417, 


L88  THF.OKY    OF    SUBSTITUTIONS. 

so  that  it  remains  uncertain  whether  the  form  2a    -f-  1   furnishes  an 
infinite  series  of  prime  numbei 

§  167.      We  add   the    actual  geometrical   constructions  for  the 
caM>-  p      5  and  p  =  17. 

For  p  =  5,  we  take  for  a  primitive  root  g  =  2,  and  obtain  accord- 
ingly 

g°  =  l,     gl  =  2,     ;/'  =  4,     g3  =  3     (mod.  5). 

Consequently 

i  2    i        ; 

V'n  — -  °'  ~T~  '"  •  <P\~Z  "'    T  '" 

n  +  <pi  =  -  -1,    vrus-ri  =  n  +  vri  =  —  1, 
r'  +  ?— 1  =  0, 

— 1+V5  —  l— V5 


Vri 


ro  2  »     rl  2 

If  "/"  is  substituted  for  w,  the  values  <fu  and  tr,  are  interchanged. 
The  algebraic  sign  of  sfo  is  therefore  undetermined  unless  a  par- 
ticular choice  of  w  is  made.     If  we  prescribe  that 

•;  -  o_ 

-••    .    .    .    ->'• 

(o    =  ens  _    -J-  ■  /  SMi    =    , 
')  0 

then 

2-  ;- 

c'„  =  a»  -j-  «/  =  2  ro.x    .    .      Vi  =  or  -f-  tt>8  =  2  COS  -=    . 

0  D 

consequently  cr„  >  0,  ^  <  0,  and  the  \/5   in  the  expression  above  is 
to  be  taken  positive.     Furthermore 

=="';   z,  —  u>-,   /:!  =  o/' 
r— ^,/  +  l  =  0; 

-i  +  V5+*Vio+2  \71 


/., 


to  =■ 


-i+  V5-;Vio+ 2Vt> 
Zl=w  = . — , 


•Cy.  Gauss:  DIsquiBit.  arlthm.,  §  362.  The  statement  there  made  that  Fermat  sup- 
posed all  the  numbers  •i-1'-  +  i  to  be  prime,  is  corrected  by  Baltzer:  Crelle  87,  p.  172.  At 
present  the  following  exceptional  cases  are  known: 

T     |   1    divisible  by    641 .Landry), 

,12 

t       i    divisible  by    114689 (J.  Pervouchine), 

i    divisible  by    167772161...    'J.  Pervouchine;  E.  Lucas  . 
i    divisible  by   274877906945   (P.  Seelhofl), 


Cf.  P.  Beelhoff:  Bchlomllch  Zeitschrift.  XXXI.  pp.  172-4. 


THE    CYCLOTOMIC    EQUATIONS. 


189 


the  sign  of  i  being  so  taken  that  the  imaginary  part  of  to  is  positive 


and  that  of  c/  negative. 


c 

• 


H 


,-" 


E\  ' 


For  the  construction  of 

the  regular  pentagon  it  is 

sufficient  to  know  the  re- 

.  2- 

solvent  cr0  =  2  cos  -g  . 
D 

Suppose  a  circle  of  radi- 
us 1  to  be  described  about 
O  as  a  center.  On  the  tan- 
gent at  the  extremity  of 
the  horizontal  radius  OA 
a  distance  AE  =  %AO=tt 
is  laid  off.     Then 

oe=  VT+i  =  -o- 


■j 


If  now  we  take  E  F '  =  E  O,  we  have 


V5  —  1 
AF-EO—  EA  =  — ^ =  ?oi 

2- 
AF=  2cos-=-. 
5 

Finally  if  if  is  bisected  in   G  and  GffJ  drawn      to  Oi  and 

2- 
OC  I  to    JEfJ,    then    HOC=COJ—-^-,   since  cosHOC  =  AG 

=  co.s~"~  .     if,  C,  and  J  are  therefore  three  successsive  vertices  of  a 
o 

regular  pentagon. 

§  168.     For  p  =  17  we  take  for  a  primitive  root  g  =  6.     Accord- 
ingly we  have 

o0,  </\  ri  g3,  g\  g\  tf,   v',  rt  9*>  ox\  g11,  flfVs18,  gu,  ol\  </,a; 

1,    6,    2,  12,   4,    7,    8,   14,  16,    11,  15,     5,    13,   10,     9,     3,    1; 
<p0  =  oj  +  a>a  +  to*  +  «/  +  wlu  +  w15  +  w13  +  w\ 
?i  —u,6-\-  wu  -f  oi  -f  a»14  +  w11  +  <//J  +  fl>10  +  u>J; 
Vo  +  9i  =  —  1- 


190  THEORY    OF    SUBSTITUTIONS. 

To  rind  </„  p , .  we  multiply  every  term  of  cr0  into  the  A;th  term  to 
the  right  of  that  immediately  below  it  in  cr, ,  taking  successively 
k  =  0,1,  ...      We  obtain  then 

<Po  <Pi  =  9\  +  9o  +  9o  -\-  9>o  +  fi  +  fi  +  ?i  +  9o  =  4  (?0  +  Pi)  =  — 4. 
Consequently 

?'o+?,i  =  —  1)     9>o9i  =  —  4 

r  +  v  — -1  =  0, 
-1+VT7  -l  —  V17 


fl 


2  '    ri  2 

where  the  sign  of   V  17   is  undetermined  until  the  particular  root 
(a  is  specified.     If  we  take 

2*  ,    .   .    2* 

m—  COSir=-\-lStnj=, 

we  have  for  the  determination  of  the  sign 

cr,  =  (o>3  +  wM)  +  (o»5  +  w12)  +  (a*8  +  »u)  +  (o>7  +  to10) 

0r     6*         io,r         12*         14*1 

=  2  [cos  j=  +  cos  ^-  -f-  cos  ^  +  ro.s      -  J 
,[       r,-  7-  5*  3*1 

=  21  COS  -= COS  -=  —  COS  p=r  —  COS  -r  „- J  ^ 

.:.9i<0t 

and   Vl7  above  must  be  taken  positive. 

We  have  further 

/o  =  a,  +  w*  +  w'«  _|_  »»  £  =  a.2  +  ws  +  ai"  -f  a»9 : 

Zj  =  a»8  -f  w7  +  a>"  +  w10,  /,  =  w1"  +  o,u  -f  wD  -}-  at' ; 

/../,  -=/.;+/.  +/o  +  /,.=  —  1,      XiXz—Xa +X»  +*2 +*i  = — lj 
X*--nX — 1  =  0,  f — 9\X — 1=0; 


*>_,       /yo2  +  4  _ft.       I<P? 


+  4, 


4 

The  algebraic  signs  are  again  easily  determined.     We  have 


THE    CYCLOTOMIC    EQUATIONS.  191 

•1-  s- 


Xo  =  (a,  +  «„'")  +  («,*  +  «,'   |    =  2  (  ros  "_   4-  COS  '  .    )        0, 
/2  =  („•  +  „«)  _!_(„!  _J_  wi0)  =  -2  (  ,,,,  '^  +  ro.5^t  )  <  0, 
Consequently 


Po  /  9o    i   -,  Po  /  Po2   ,    1  . 

Zo  =  y  +  yT  +  l,       ft— 2---yx+1, 


With  /„  as  a  basis  we  proceed  further : 

c'v  —  <w  +  w,r,?      #,=<»*  + a*" 


tf'o  +  <'\  =  Zoi    Mi  =  ft  =  -^r  +  a/  T  ""*"  *' 


2-  8- 

Siuce  now  c'-0  =  2  cos  - = ,  0,  =  2cos^,  we  have  c\,  >  c'-, ,  and  there- 
fore 


C'<„=^4-         /ft  v  ,',     -   ^0  Z""  v 

'°       2^a/T~~  /3'     01""T""V"2"" 

These  results  suffice  for  the  construction  of  the  regular  polygon 
of  17  sides.  Suppose  a  circle  of  radius  1  to  be  described  about  O 
as  a  center,  and  a  tangent  to  be  drawn  at  the  extremity  of  the  hori- 
zontal radius  OA.  On  the  tangent  take  a  length  AE  =  \OA  —  \: 
then 

\/17 


OE=  Vl-r-A  = 
Further,  if  EF—EF'  =  EO,we  have 

A^-        4        ~2'  4 


192 


THEORY    OF    SlTBKTITrTIONS. 


OF:       ^    *L  +  1,  OF'         ^     £  +  1. 


Taking  then 
we  have 


FU  —  FO,     F'H'  =  F'0, 


n 


AH=AF+FO       f  +  TJ:f+1=Xo, 


n 


AH'  =  —  A  F'  +  F'O  -  ^  +  J£  +1  =Xs< 


We  bisect  A  if  in  )':  then 


AY=fa. 


THE    CTCLOTOMIO    EQUATIONS.  193 

We  take  now  AS  =  1.  and  describe  a  semicircle  on  H'S  as  a  diam- 
eter; if  this  meets  the  continuation  of  OA  in  K,  then 

AK2  =  AS-  AH'  =/,. 

Again  if  we  take  LK  =  AY  and  KL  =  LM  =  LN,  and  describe  a 
circle  of-  radius  LK  about  L,  we  obtain 

AN+AM  =  2KL  =  2AY=Xo  =  <p0+<p1 
AN-  AM=AK*  =  AS   AH'  =  -/,  =  cW 

The  greater  of  the  t'wo  lengths  AN.  AM  is  equal  to  c'-„;  we  may 
write  therefore 

2- 

A  M  —  <,'•„  =  2  COS  :p=  . 

1  ( 

If  P  is  the  middle   point  of  AM,  and  if  QP         AO,  and  OD 
A  0,  then  Q  and  D  are  two  successive  vertices  of  the  required  reg- 
ular polygon  of  17  sides. 

§  169.     We  consider  now  the  case  />,  =  2,  under  the  assumption 
p  >  2.     If  g  is  a  primitive  root,  then 

tr|1  =  u)  -f-  to"'  -f-  '"    -)-...-)-  o)9        , 
</>,  =  io9  -f-  <>;  -f-  <>'  -\-  .  .  .  -f-  a)9l'~.2, 
<Po  +  ^l  =  —  1- 

To  determine  ^0w,  we  use  the  same  method  as  in  the  preceding 
Sections,  and  obtain 

+  ... 

The  exponents  which  occur  here  in  any  bracket 

S^+'  +  l,  sW+,  +  l),  fir*(fl^+,4-l), ... 

are  plainly  either  all  quadratic  remainders,  or  all  quadratic  non- 
remainders,  or  all  equal  to  0.  In  the  first  case  the  value  of  the 
corresponding  bracket  is  c0,  in  the  second  case  a>l)  and  in  the  third 

p  —  l 
case  — =p- . 

'  13 


iy  I  THB0KT    OF    SUBSTITUTIONS. 

Consequent  1\ 


S) 


to,  -\-  m.  4-  ?».  =  — - — , 


where  ///,,  m.,  m ,  represent  the  number  of  brackets  of  the  several 
kinds. 

If  <fa  + '  +  1  =  0  ( mod.  p  ) ,  then  2  (2a  -j-  l)=p-  1  and  accord- 

ingly  0  is  an  odd  number.  The  third  case  occurs  therefore  only 
when  p  =  4fc-}-.3,  and  then  only  once,  viz.  f or  «  =  — — .  Con- 
sequently m:.  —  0  or  >/>;,  =  1  according  as   — - —   is  even  or  odd. 

Since  <?0<P\  is  rational  ami  integral  iu  the  coefficients  of  the 
cyclotomic  equation  I),  this  product  is  an  integer,  and  we  nun 
therefore  take 

P—  1  i 

fa  ?i        '»h  — S-    =  "  =  —  W  (  Fo  +  9' i  ) 

where  ;/  is  an  integer.     It  follows  then  from  £>' )  that 

(mi  -f-  w)  p0  -j-  (  //t_,  +  ?i )  cTj  =  ( I 

In  this  equation  all  the  powers  of  <»  can  be  reduced  to  powers  lower 
than  the  pth,  and  the  equation  can  then  be  divided  by  <».  The 
resulting  equation  is  then  of  degree  p  —  2  at  the  highest,  and  still 
has  the  root  to  in  common  with  the  equation  1  )  of  degree  p  1. 
It  is  therefore  an  identity  and 

77i,  =  m.>  =  - —  n 

Consequently  we  have  for  the  values  of  ///,.  m ,  and  crn,  cr, 

p  —  1  /'— 1  fP  —  1  \ 

m,=.m.,=  -j—,     cp0^,  =  -    — j— ,  (— ^—  even) 


p  t3  p  —  l    p— 3    p  +  i    rp— l 

«/,=TO2  =  — ,       ^0^1  = 


t-',,  cr. 


2  4  4 

y-i 

_!-(-!)  '  P 


[,  (^odd) 


THE    CYCLOTOMIC    EQUATIONS.  195 

P  — 

{<f  —  9o)  (f  —  9\)  —  9iJr9  + 


l-(-l) 2 

p 

5 

4 

.-i-V(- 

P- 

-1 
P 

i+V(_ip',, 

'"~  2  '         1_  2 

where  the  algebraic  sign  of  tlie  square  root  is  necessarily  undeterm- 
ined so  long  as  the  particular  value  of  to  is  not  specified. 

§  170.     We  consider  now  the  two  equations 

z0  =  (x  —  w  )  (a;      < » "• )  (a-  —  w  '■>*)  ...(.c  —  w ;' J'    I  =  0, 

Zi^CC —  a>9)  (X  —  Oi9*)  (x  —  co'j:)  .  .  .  (x-  cor'P^'!)  —  (). 

The  roots  and  consequently  the  coefficients  of  these  equations  are  un- 
changed if  w  is  replaced  by  <uB°\  If  therefore,  when  the  several 
factors  are  multiplied  together,  any  coefficient  contains  a  term 
mat*,  it  must  also  contain  terms  m(oagi,  nnoa9\  ....  that  is,  it  con- 
tains c5„  or  <fl ,  according  as  a  is  a  quadratic  remainder  or  non- 
remainder  (mod.  p).  Accordingly  every  coefficient  will  be  of  the 
form 


g+oyj(—i)  2  P 

and  on  introducing  these  values  we  have 


_x+Yyj(-iy  p 


"2 


where  X  and  Y  are  integral  functions  of  x  with  integral  coefficients. 
Again  since  z,  is  obtained  from  ^u  by  replacing  w  by  to9,  or  <r0  by  <fx , 
that  is,  by  a  change  of  the  sign  of  the  square  root,  we  have 


X—Y 


«i- 


\{-ir\ 


Hence 


p-i 

■i 


z0z} 


xp—l_   X2  —  (  —  l)   2  pY 


x  —  l 


1VJH  THEOBT    OF   8TTB8TITOTIOIT8. 

and  we  have 

Theorem   IX.     For  every  prime  number  p 

where  X  and   Y  are  integral  functions  of   x  with  integral  coeffi- 
cients. * 


*The  extensive  literature  belonging  to  this  Chapter  is  found  in  Bachmann:  Lehre 
von  der  Kreistheilung,  Leipzig,  Teubner,  1872.  The  present  treatment  follows  in  part 
the  method  there  employed.    The  two  figures  are  taken  from  Bachmann's  work. 


CHAPTER   XL 


THE    ABELIAX    EQUATIONS. 

§  171.  The  cyclotomic  equation  has  the  property  that  it  is  irre- 
ducible and  that  every  one  of  its  roots  is  a  rational  function  of  every 
other  one.  We  turn  now  to  the  treatment  of  the  more  general  prob- 
lem of  those  irreducible  equations  of  which  one  root  x\  is  a  rational 
function  of  another  root  xx.  Among  these  equations  the  cyclo- 
tomic equation  is  evidently  included  as  a  special  case. 

Suppose  that 

1)  f{x)  =  0 

is  the  given  irreducible  equation,  and  that  two  of  the  roots  x\  and  cc, 
are  connected  by  the  relation 

2)  x\  =  t)(Xl), 
where  0  is  a  rational  function.     Then 

f{aH)  =  0,    f[0(xl)-]  =  Q, 

so  that  the  irreducible  equation  1)  has  the  root  .£,,  and  consequently 
all  its  roots,  in  common  with  the  equation 

3)  /['(*)]  =  <>. 

In  particular  x\  =  0{xx)  must  be  a  root  of  3),  so  that 

f\o[e(Xlm=0. 

Consequently  0[#(#,)J  is  a  root  of    1)  and  therefore  of   3).     Then 
0  |0[0(#i)]  \  is  a  root  of  1),  and  so  on.     With  the  notation 

d  [d  {x)-]  =  02  (x)] ,     0  [d>  (a;)]  =  02[0  (* )]  =  6*  (x),  . . . .  , 

it  appears  that  all  the  members  of  the  infinite  series 

<*>  *(»i),  6\^),  ^(*i),   •••   6\*i),   ••• 
are  roots  of  the  equation  1).      Since  however  the  latter  has  only  a 
finite  number  of  roots  it  follows  from  a  familiar  process  of  reason- 


198  THEORY    OF     SUBSTITUTIONS. 

ing  that  there  must  be  in  the  series  a  function  ^"'(cc,)  which  is  equal 
to  the  initial  value  xt ,  while  all  the  preceding  functions 

.ri,0(x1),0\Xl),...0'"-1(xl) 

are  different  from  one  another.     The  continuation  of  the  series  then 
reproduces  these  same  values  in  the  same  order,  so  that  only 

F»(xl)  =  62'n(x1)  =  .  .  . 

take  the  initial  value  xA ,  and  that  for  k  <  m  only 

ir  i-*^)  =  0*"    *(#,)=  .  .  . 

are  equal  to  t>k'(x^). 

If  the  system  of  in  roots  thus  obtained  does  not  include  all  the 
roots  of  the  equation  1 ),  suppose  that  .v.,  is  any  remaining  root. 
Then  x,  also  satisfies  3),  and  therefore  0(x2)  is  a  root  of  1),  and  so 
on.     Accordingly  we  have  now  a  new  system  of  :>■  different  roots 

Xii6{xi),e\x2\...d^~\x2). 

But  since  the  equations 

4)  ffm(y)—y  =  0   W(z)—Z  =  Q 

have  each  one  root  y  =  xx ,  z  =  x.,  in  common  with  the  irreducible 
equation  1),  they  are  satisfied  by  all  the  roots  of  the  latter.  The 
former  equation  of  4)  is  therefore  satisfied  by  .rL,,  the  latter  by  a;,, 
consequently  tn  is  a  multiple  of  fi  and  />.  is  a  multiple  of  to,  L  e. 
m  —  v. 

Again  all  the  roots  of  the  second  series  are  different  from  those 
of  the  first.     For  if 

ffi(xi)  =  P(xi)     (a,b<m), 

then,  on  applying  the  operation  0m~b,  we  should  have 

0m(xa)  =  xa=0m+—b(cc1), 

and  x2  would  be  contained  in  the  first  series,  which  is  contrary  to 
assumption. 

If  there  is  another  root  x3 ,  not  included  among  the  2m  already 
found,  the  same  reasoning  applies  again.     We  have  therefore 

Theorem  I.  If  one  root  of  an  irreducible  equation  f(x)  =  0 
is  a  rational  function  of  another,  then  the  roots  can  be  divided  into 
>  systems  of  m  roots  each,  as  in  the  following  table : 


5) 


THE  ABELIAN  EQUATIONS.  19W 

xu  0(0;,),  Pfa),  ...em-\xj, 
x2,  B(xi),  »Ji u-.).  .  .."      l(a?3), 


xv,  n(xv).  <Hxv),  ...(>"' ~l{xr). 
The  function  6  is  such  that  for  every  root  xa 

0m(xa)  =  xa, 
and  the  equation  f  (x)  =  0  is  of  degree  m>. 

§  172.  We  can  now  determine  the  group  of  the  equation  1). 
Since  the  equation  is  irreducible,  its  group  is  transitive  (§  156);  it 
therefore  contains  at  least  one  substitution  which  replaces  Xj  by  any 
arbitrary  xa.  It  follows  theu  that  all  the  roots  of  the  first  line  of 
5)  are  replaced  by  those  of  the  «th  line.  The  group  of  1)  is  there- 
fore non-primitive  and  has  v  systems  of  non-primitivity  of  m  ele- 
ments each.  The  number  of  admissible  permutations  of  the  v  systems 
is  not  as  yet  determinate;  in  the  most  general  case  there  are  \>\  of 
them.  If  any  xa  is  replaced  by  0A(a?a),  then  every  "*"(.*■„)  is  replaced 
by  0*+A(a?a);  there  are  therefore  m  possible  substitutions  within  the 
single  system.  The  order  of  the  group  of  1)  is  therefore  a  multiple 
of  mv  and  a  divisor  of  v\mv. 

Theorem  II.     The  grotvp  of  the  equation  1)  is  non-jprimitive. 

It  contains  v  st/stems  of  non-primitivity,  which  correspond  to  the 
several  lines  of  5).     The  order  of  the  group  is 

r  =  r,  m", 
where  r,  is  a  divisor  of  v\, 

§  173.     In  the  following  treatment  we  employ  again  the  notation 
of  Jacobi 

z0  4-  toz1  +  to-z2  -f-  .  .  .  +  tom  ~  lzm  _,  =  (<«,  z), 

where  m  is  a  root  of  the  equation  wm  — 1  =  0.     Similarly  we  write 

».  +  »%«)  + «'«■(»-)+  •  •  •  +<»,"-1(>",-\xa)  =  (w,  d(xa)). 
We  form  then  the  following  resolvents: 

9l  =  (i , o(Xl) ),  n = (i , o(&) ),■■■  ?v  =  (i , *M ) • 

cr,  is  symmetric  in  the  elements  of  the  first  system  and  is  changed 
in  value  only  when  the  first  system  is  replaced  by  another;  it  is 
therefore  a  v- valued  function,  its  values  being    cx,  cr,,  .  .  .  cr„. 


200  THEORY    OF    SUBSTITUTIONS. 

Every  symmetric  function  of  the  c's  is  a  rational  function  of  the 
coefficients  of  1 ) .     The  quantities 


that  is,  the  coefficients  of  the  equation  of  the  vth  degree 

o)  r— s19>,-1+Stfv-s— . . .  ±sy=o, 

of  which  c-,.  cr„,  .  .  .  cr,.  are  the  roots,  are  therefore  rationally  known. 

Theorem  III.      The  resolvent 

( 1,  i>(x,) )  =  sb,  +  »(xx)  +  &(xx)  +  .  .  .  +  »'" ~ '(.<•, ) 

is  a  root  of  an  equation  of  degree  >,  the  coefficients  of  which  are 
rationally  known  in  terms  of  the  coefficients  of  the  equation 
f(x)  =  0. 

i>  174.  The  equation  6)  has  no  affect  (§158),  unless  further 
relations  are  explicitly  assigned  among  the  roots  xn  x2,  •  •  •  xn.  If 
however  any  root  ca  of  (5)  has  in  any  way  been  determined,  the 
values  of  the  corresponding  .ra,  n(.ra),  .  .  .  can  be  obtained  algebrai- 
cally by  exactly  the  same  method  as  that  employed  in  the  preceding 
Chapter. 

Thus,  the  equation  #)  of  which  the  roots  are  x,  0(x),  0\x),  .  .  . 
0m~\x)  is  irreducible.  Its  group  consists  of  the  powers  of  the  sub- 
stitution (\0()2 .  .  .  (J"'-1).     And  if  we  write 

where  w  is  now  assumed  to  be  a  primitive  mth  root  of  unity,  we 
have 

[O(x)+wO%x)+...+<o'''-10m(x)']m  =  ujm[0(x)+<oO2(x)  +  ...a>m-10m(x)~\ 

=  (a>,o(x)-\»; 

that  is  T,  is  unchanged  by  the  substitution  (\O02 .  .  .  flm- ').  Conse- 
quently T,  is  a  rational  function  of  the  coefficients  of  #)  and  of 
the  primitive  mth  root  of  unity  to.  The  mtb  root  of  this  known 
quantity   1\  we  denote  by  r, .     Again  if  we  write 

(oj\0(xj)(aj,0(x)r-*=Tx, 

it  can  be  shown  by  the  same  method  that  we  have  already  frequently 


THE    ABELIAN    EQUATIONS.  201 

employed  that  rl\  is  also  rational  in  o>  and  the  coefficients  of  &). 
Taking  successively  /.  =  0,  1.2....  m— rl,  and  combining  the  result- 
ing equations,  we  have  then 


rji 


m0(x)  =  cr  +  -r,  +  -2t  V+  "8S  m8  +•••+'■ 


w  "Mi 


The  function  rx  being  m-valued,  a;  also  admits  only  m  values,  and 
these  coincide  with  x ,  0(x),  02(x) ,  .  .  .  .  If  any  other  m th  root  of  Tx 
is  substituted  for  t,  ,  the  m  values  of   x  are  permuted  cyclically. 

Theorem  IV.  If  the  m  roots  of  an  equation  of  degree  m 
are 

where  0(x)  is  a  rational  function  for  which  0m(x1)  =  x} ,  then  the 
solution  of  the  equation  requires  only  the  determination  of  a  primi- 
tive root  of  z"'  — 1  =  0  and  the  extraction  of  the  m?'  root  of  a 
known  quantity. 

Theorem  V.  If  one  root  of  an  equation  of  prime  degree  is 
a  rational  function  of  another  root,  the  equation  can  be  solved 
algebraically. 

For  in  this  case  we  have  m>=p  and  m  >  1 ;  consequently 
m=p  and  v  =  1. 

§  175.  If  all  the  coefficients  of  f(x)  are  real,  the  process  of 
the  preceding  Section  admits  of  further  reduction.     The  quantity 

Tx  —  (a* ,  0(x))'"  =  p(cos #  +  isinQ) 
can  be  rationally  expressed  in  terms  of  u>  and  the  coefficients  of  /. 
The  latter  being  real,  the  occurrence  of    *  =  V  —  1  in.  ^i  is  du© 
.entirely  to  the  presence  of  o>.     Consequently. 

T,'  =  (io-\  0(x) )m  -  p(cos &  —  i  sin &),     T&  =  f, 

is* 


202 


THEORY    OF    SUBSTITUTIONS. 


where  U  is  again  rationally  known,  since  it  is  unchanged  by  the 
group  of  c .     We  have  then. 

rl  =  V  U\  cos \-iHin — ! I. 

V.  m  ni      J 

Theorem  VI.  If  all  the  coefficients  of  f(x)  are  real,  the 
second  operation  of  Theorem  IV  can  be  replaced  by  the  extraction 
of  a  square  root  of  a  known  quantity  and  the  division  of  a  known 
angle  into  m  equal  parts. 

§  176.  If  the  m  of  the  Theorem  IV  is  a  compound  number,  the 
solution  can  be  divided  into  a  series  of  steps  by  the  aid  of  special 
resolvents.  If  m  =  to,  to/,  where  to,  is  any  arbitrary  factor  of  to,  we 
take 

0,  =  xx  +  #'"'  (a;,)  +  <M  (as,)  +  . .  .  +  0*'"'1  ~  ,)m>  (Xj) , 

tp3  =  0{x,)  +  u'"i  + '  (xx)  +  02,">  + 1  (x,)  +  .  .  .  +  tf('"'>  - ») '">  + '  (a;,) , 

V'.„(]  =  0-1  ~ » fa)  +  *■"*  - :  (as,)  +  03'"1  -  'fa)  +  .  .  .  +  <r'i"*i  - '  (a;,) , 

and  consider  the  resolvent 

[xl  +  al6(xi)+a1W(xl)+  .  .  .  +  «,"- •ar-'fo)]"! 

in  which  a,  is  a  primitive  w.,th  root  of  unity.  This  resolvent  is 
equal  to 

If  .r,  is  replaced  by  0(ar,),  then  <pu  <p%, . . .  </<„,,  are  cyclically  permu- 
ted, and  the  resolvent  is  unchanged.  It  can  therefore  be  ration- 
ally expressed  in  terms  of  a,  and  known  quantities.  We  denote 
this  expression  by  2V,  and  its  m,th  root  by  v, ,  so  that 

<!'i  +  <h<P?  +  OiVa  +  •  •  •  +  <"'  _ '  V'„,  =  ",  • 
If  then,  as  before,  we  write 

(<\  +  «lV'2  +  «l*ft  +  •  •  •)  (ft  +  «,  ft  +  «l'ft  +   •   •   •  )'"'  _  A  =  ^A, 

it  appears  that  N\  is  rationally  known,  and  that 

^2  =  f1+«r'v1  +  «r2^^-i-«r3^v13+..., 


THE    ABELIAN    EQUATIONS. 


"208 


Theorem  VII.  The  mrvalued  resolvent  </',  can  be  obtained 
by  determining  a  primitive  root  of  z'"'  — 1  =  0  and  extracting  the 
m,th  root  of  a  known  quantity. 

By  continuing  the  same  process,  we  obtain 

Theorem  VIII .  //  the  roots  of  an  equation  of  the  m** 
degree  are 

xy ,  e(x1\  o\x,), . . .  o- -  V,) ,     [>"(.£,)  =  1] 

and  if  in  =  m1m2m3  .  .  . ,  the  sohdion  of  the  equation  requires  only 
the  determination  of  a  primitive  root  of  each  of  the  equations 
gm,-i_0}  £».,_!  _o?  2m8_l=0,M. 

and  the  successive  extraction  of  the  m,"1,  m2th,  m3th,  .  .  .  roots  of 
expressions,  each  of  ivhich  is  rationally  known  in  terms  of  the  pre- 
ceding results. 

§  177.  The  solution  can  also  be  accomplished  by  a  still  different 
method. 

Suppose  that  m  =  mxnu  .  .  .  mu=  m,tfix  =  m.2n2  =  . . .  =  m01  tiM  . 
Then  we  can  form  the  following  equations : 

g,(x)=Q,  with  the  roots  xu  on,Uxt).  e^(x1),  .  .  .  d^-^fa), 
and  with  coefficients  which  are  rational  functions  of  a  resol- 
vent /,  =  ,r,  +  "'"^  (Xi)  -\~  ■  .  .      /i   is  a  root  of  an  equation 
»    1>i  ('/)  =  0  of  degree  m, . 

C  g,(x)  =  0,  with  the  roots  xl,0m*(xj,Pm»(xJt  .  . .  rt^"  *>%(*,), 
and  with  coefficients  which  are  rational  functions  of  a  resol- 
vent Xi  —  xi  +  V'"Hx})  +  .  .  .     /..  is  a  root  of    an  equation 
h2(b/)  =  0  of  degree  m, . 


A,) 


A2) 


Aj 


gm(x)  =  0,  with  the  roots ; »,,  0"'a'(xi),o^(xi),  .  .  .  <?("—  ^"-(a:,), 
and  with  cofficients  which  are  rational  functions  of  a  resol- 
vent yM  =  .r,  +  0""0  (ah)  +  •  •  •  Z<o  is  a  root  of  an  equation 
h„  (/)  =  0  of  degree  mu . 
If  now  we  select  mM  w2,  .  .  .  mm  so  that  they  are  prime  to  each 
other,  then  the  equations 

g,(x)  =  0,    g.2(x)  =  0,  .  .  .  gjx)  =  0 


204  THEORY    OF    SUBSTITUTIONS. 

have  only  the  one  root  r,  common  to  any  two  of  them.  By  the 
method  of  the  greatest  common  divisor  this  root  can  be  rationally 
expressed  in  the  coefficients  of  glf  gai  .  .  .  gu,  that  is.  in  the  coeffi- 
cients of  /(.<")  and  in  /,,  /..,...  /„■ 

The  solution  of  f(x)  =  0  depends  therefore  on  the  determination 
of  one  root  of  each  of  the  equations 

fciOr)  =  0,   h{x)  =  Q,...hjz)  =  Q 

of  degrees  m,,  m.,,  .  .  .  mm1  respectively.     If 

where  px ,  p2 >  •  •  •  P*  are  the  different  prime  factors  of  m ,  then  we 
are  to  take 

mi  ~Pa,y  m2  =  P%  •  •  •  m<o  =Pma,a- 

If  for  any  one  of  the  equations  hK(%)  =  0  the  exponent  aK  is 
greater  than  1,  then  recourse  must  be  had  to  the  earlier  method  of 
solution  to  determine  a  yk  ■ 

§  178.  In  illustration  of  this  type  of  equations  we  add  the  two 
following  examples.     In  the  one  case  we  take 

where  n.x  =  a,  fa  =  8,  y:  =  y}  8X  =  8  are  real  quantities.  We  assume 
that  an  —  8y  |=0;  otherwise  we  should  have 

8       a 
0(x)  =  '-=     . 

V 

The  functions  02(x) ,  6^(x) , .  . .  will  also  be  linear  in  .r  with  real 
coefficients.     We  may  write 


Again 


LWJ"r.-.(«^+/»i)  +  *— .(rl«+«,), 


and  a  comparison  of  the  two  expressions  for  0"'{x)  shows  that 

"■...  =  «l«m  — 1  +  /')/5'„1_1,        ,?,„  =  Pi"-,,,  _i  "I-  8lSm_li 

y,„  —  «i  r»  - 1  +  n*™  - 1 »    ,J»  =  ftr^  -i  +  *i  *«i  - 1  • 


THE  ABELIAN  EQUATIONS.  205 

From  these  equations  we  obtain  at  once  the  characteristic  relation 

—  (^ Sj  —  ft  Yl)2  (am  _  2dm  _  2  —  {im  _  2  ym  _  2 ) 

=  («*— /?r)w. 


By  dividing  every  coefficient  of  0(x)  by  a/ ad — fiy  or  by  V 'fr — a'^ 
according  as  ad — fiy  is  positive  or  negative,  we  can  arrange  that  for 
the  new  coefficients  of  0{x),  and  consequently  for  those  of  every 
0k{x),  the  relation  shall  hold 

8)  ad  —  fr=±l. 

We  determine  now  under  what  conditions  it  can  happen  that 

6>"{x)  =  x. 

The  values  of  x  which  are  unchanged  by  the  operation  0  satisfy  the 
equation 

ax-}-  j3 

X~  yx  +  d' 

yx2  -f-  (d  —  a)  x  —  ,5  =  0. 

For  these  fixed  values  we  have  therefore,  according  as  ad  —  t3y  =  ±  1, 


and  consequently 


yx 
yx 


'  —  a  Ya  +  d  Ifa  +  d'V      ,  V 


A)     We  assume  in  the  first  instance  that  x'  and  x"  are  distinct, 
that  is  that  iV-]-l.     We  have  then 

d(x)—x'   _N 


9{x)—x" 

0"'(x)—x' 
i)'"{x)—x" 


=  N 


x  —  x' 

02(x)- 

-x' 

—  N2X       X 

II  5 

X  —  X 

x—x"' 

mx  —  x' 

e\x)- 

-x" 

x  —  x" 

The  necessary  and  sufficient  condition  that  0m{x)  =  x  is  there- 
fore that 


'200  THEORY    OF    SUBSTITUTIONS. 


This  condition  can  be  satisfied  by  complex  or  by  real  values  of 
the  quantity  in  the  bracket.  In  the  former  case  the  upper  alge- 
braic sign  must  be  taken,  and  further 

so  that  we  may  write 

a  +  d 

—^—  =  cos  <f 

Nm  =  (cos  (f  —  i  sin  (ffm  =  cos  2m<p  —  i sin  2  me. 
Accordingly,  we  must  have  2m<p  =  2k~,  <p  —  —  ,  and 

a  +  ?i  k- 

where  k  is  any  integer  prime  to  m.  If  the  condition  9)  is  fulfilled, 
the  function  0"'(x)  will  be  the  first  of  the  series  0(x),  »:(-c),  ...  to 
take  the  initial  value  x. 

If  the  quantity  in  the  bracket  is  real,  it  must  be  either  + 1  or  —  1 , 
since  one  of  its  powers  is  to  be  equal  to  1.  The  case  N=  + 1  is  to 
be  rejected,  since  then  x'  =  x".     The  case  N  =  —  1  gives 

a  +  *  =  0,   a2  +  /Sr=0, 

and  (>'(■>■)  =  x,  which  agrees  with  the  condition  9),  since  in  —  2. 
B)     It  remains  to  consider  the  case  x'  =  x".     We  have  then 

■a  +  d  i 

T 

The  lower  sign  must  be  taken,  and  accordingly 

a  +  d  =  ±2,  ad  -fr=+k 

It  follows  that 


m±i-* 


o\x)  - 

(2a 

Tl).r 

+  2/5 

2r#+(2d 

+  1)' 

e\x) 

(3a 

=F2)x 
:  +  (33 

;    3/S 

1  2)' 

/'(,■, 

|  ma  =F  (m 

— 1> 

+  mft 

If  now  w'"(x)  =  x,  we  have 


THE  ABELIAN  EQUATIONS.  207 

ra*  +  (d—a)x—p  =  0, 

that  is,  we  must  have  already  had  9{x)  =  x.  And,  again,  it  is  clear 
that,  as  m  increases.  (T(x)  approaches  the  limiting  value 

We  have  shown  therefore  that 

k~ 

a  4-  d  =  2  cos  — ,     "•'»  —  ,J/'  =  4- 1 , 
ra 

where  A;  is  prime  to  m,  are  the  sufficient  and  necessary  conditions 
that  (T(x)  shall  be  the  first  of  the  functions  0K(x)  which  takes  the 
initial  value  x.     For  m  =  2 ,  the  second  condition  is  not  required. 

§  179.  For  the  second  example  we  take  for  0(x)  any  integral 
rational  function  of  x  with  constant  coefficients. 

For  every  integral  m  the  difference  0m(x)  —  x  is  divisible  by 
0(x)  —  x.     For  if 

0(x) — x=  (x — z1)(x — z2)  . .  .  (x — zv), 

then  for  every  za  0(za)  =za,  and  consequently  02(za)  =  03(za)  =  .  . . 
=  0k(za)  =  za .    Moreover 

6k+i(x)  —  el(x)  =  [0*(a;)  — z,]  [G\x)—z.^  .  .  .  \?(x)— zv~\, 
and  consequently 

0k  +  \x)  —  6k(x)  _  P(x)—zl  0k{x)—z2        0k(xv)  —  zv_,  . 

— —  . ■  (  ^  ^  —  ItjAQC)  ? 

where  P  is  a  rational  integral  function  of  x  and  of  the  coefficients 
of  0,  since  it  is  symmetric  in  the  roots  zlt  %,  . . .  zv.  If  now  we  take 
k  successively  equal  to  0,  1,  2,  .  .  .  m  —  1,  and  add  the  resulting 
equations,  we  have  as  asserted 

0"'(x)—x  =  [0(x)—x]  Q(x), 

where  Q  is  a  rational  integral  function  of  x .  From  this  equation  it 
follows  that  for  every  root  of 

Q(x)  =  0 

we  have  0m(x)  =  x,  and  conversely  that  every  root  of 

0m(x)—x  =  O, 


208  THEORY    OF    SUBSTITUTIONS. 

which  is  not  contained  among  z,,  z.,,  .  .  .  zv  also  makes   Q(x)  vanish. 
Every  root  r  of  Q(x)  =  0  therefore  gives 

and  consequently  also 

0'"  +!(£)  =  0(£),      flr[0(£)  ]  =  (?|  5 ). 

so  that  #(c),  and  likewise  02(£),  #3(f),  ...  are  all  roots  of  #(x)  =  0. 
Again  since  =  is  different  from  the  z's,  0(5)  -f- 1,  and  fl(|)  ==ztt. 

Theorem  IX.     If  0(x)  is  a  rational  integral  function  of  x 
of  degree  >■> ,  then  the  roots  of  the  equation  of  degree  (v  —  l)ra 

caw  be  arranged  as  in  Theorem  I,  5).     If  m  is  a  prime  number  then 
each  of  the  v  —  1  rows  of  5)  contains  m  roots 

*,m *(*>,•• -i*-1®   p-w^o 

§  180.     Conversely  if  the  equation  /  (x)  =  0  has  the  roots 

x0,x1  =  0(x0),  x2  =  62  (x0),  ...xm_l=6m  ~l(x,) ;      [(>m(x0)  =  .r„]  . 

every  one  of  these  roots  will  also  satisfy  the  equation 

m(x)—  x  =  0, 

but  no  one  of  them  will  satisfy 

b(x) — x  =  0; 

consequently  /  (x)  is  a  divisor  of   the  quotient 

Hm(x)  —  x 
o(x)  —  x 

The  restriction  that  e(x)  shall  be  an  integral  function  is  unessen- 
tial.    For  if    (x)  is  fractional 

6{X)  —      t— ;  , 

where  a,  and  g2  are  integral  functions,  then  in 

g(x  x  _  gi(a?o)[ga(agi)flf2(a?a)  •  •  •  ga(a?«.-i)] 
02(#o)  92(^1) gi(pt:a)...gi(xm_l) 

the   denominator,   being    a  symmetric    function  of    the    roots   of 
/(#)  =  0,  is  a  rational  function  of  the  coefficients  of  f(x);  and  the 


THE  ABELIAN  EQUATIONS.  209 

second  factor  of  the  numerator,  being  symmetric  ina;Mx2,  ...  xm  _ , 
is  a    rational    integral    function    of    x0.      Consequently  0(x0)  is   a 
rational   integral    function   of  x0,    which   can    be    reduced   to    the 
(m — l)th  degree  by  the  aid  of  f(x0)  =  0. 
We  have  therefore 

Theorem  in  X.     Every  polynomial  of  the  equations  treated  in 
§  174  is  a  factor  of  an  expression 

9l"'(x)  —  x 

0x(x)—x  ' 

where  9x{x)  is  an  integral  function  of  the  (m — l)th  degree. 

For  example,  if  we  take  0X  —  x~  +  bx  +  c ,  we  may  reduce  this 
by  the  linear  transformation  y  =  x  +  « to  the  form  (\  =  x2  +  a.    Then 

9*1  x)  —x  =  (  01(x)—x)  |>6  +  x>  +  (3a  +  \)xk  +  (2a  +  l)x' 

+  (3a2  +  3a  +  l)x2  +  (a2  +  2a  +  l)x  +  (a3  +  2a2  +  a  +  1)  ]. 

The  discriminant  of  the  second  factor  on  the  right  is 

J  =  — (4a  +  7)(16a2  +  4a  +  7)2. 
If  now  we  take 

4a  +  /  =  —  Ar,     a  = -r —  , 

the  second  factor  breaks  up  into  two,  and  this  is  the  only  way  in 
which  such  a  reduction  can  be  effected.     We  have  then 

0,(;r)—  x 
[8.r3  +  4(1  +  k)x*—  2(9  —  2k  +  k2)x—  (1  +  7fc— fc2  +  fc3)] 
[8arj  +  4(1 — k)x>— 2(9  +  2fc  +  k2)x—{l  —  lk—k2—k*y\ 

or,  for  fc  =  2A  +  1,  a  =  —  /-  —  /  —  2, 

[y  _  A  ^  _  ^.  +  2/  +  3)a  +  (^  +  2/-'  +  3;.  + 1 )] . 

In  this  way  we  obtain  the  general  criterion  for  distinguishing  those 
equations  of  the  third  degree  the  roots  of  which  can  be  expressed 
by  x,  0{x),  02{x).     In  the  first  place  9  must  ^be  reducible   to    the 

form 

0  =  x2  —  (A2 +  /1  +  2) 
14 


210  THEORY    OF     SUBSTITUTIONS. 

that  is.   b*—  Ac  must  be  of  the  form  4  (A2  +  /.  +  2)  =  (2 A  +  1)-  4-  7 ; 
then  to  every  0  there  correspond  two  equations  of  the  required  type 

x  4-  ().  4-  l)a*  -  (/.-  4-  2)x  —  (/*  +  /-  4-  2/  4- 1)  =  0 
.,.  _  xrf  _  (;a  _|_  2/  +  Z)X  +  (A8  4-  2A2  +  3/  4-  1)  =  0. 

It  appears  at  once,  however,  that  <>  is  unchanged  if  /  is  replaced  by 
—{X  4- 1),  and  that  the  first  equation  is  converted  into  the  second  by 
this  same  substitution.     It  is  sufficient  therefore  to  retain  onlv  one 
of  the  two  equations. 

§  181.     We  introduce  now  the  following 

Definition.  If  all  the  roots  of  an  equation  are  rational  func- 
tions of  a  single  one  among  them, 

then,  if  these  rational  relations  are  such  that  in  every  case 

the  equation  is  called  an  u  Abelian  Equation."  * 

We  have  already  seen  (§  173)  that,  if  the  roots  of  an  equation  are 
defined  by  5),  the  resolvents 

ft  =  (1,  *,(*,)  ),   ft  =  (1,  *iM  >.  ■  •  •  ft  =  (1,  *i(«r)  ) 
satisfy  an   equation   6)   of  degree  v  the  coefficients   of  which  are 
rationally  known.     We  noted  further  that  this  equation  is  solvable 
only  under  special  conditions.     These  conditions  are  realized  in  the 
present  case.     We  proceed  to  prove 

Theorem  XI.  Abelian  equations  arc  solvable  algebraic- 
ally. ** 

In  the  first  place  we  observe  that  since  <f{  is  symmetric  in  a-, , 
OAxX  .  .  .  (fim~l(xl),  every  symmetric  function  of  these  quantities  is 
rational  in  <fx  and  the  coefficients  of  1).     If  now  we  consider 

ft  =  x%  +  °M  +  'Vfo)  +  •  •  •  +  <>r  l0*a), 

and  assume  that 

jr..  =  02(a;,), 
we  have 

c2  =  e2{Xl)  +  ete2(xi)  +  ^%{-^)  +  •  •  •  +  K  %{x,  > 

=  ^,)  +  ¥i(a'i)  +  ¥I2(-',1)+  •  •  •  +W  -\*i) 
=  Sj>„  g.fo),  ^O,),  .  .  .  ff,"  -'(j,)]  =  *(?,). 

*  0.  Jordan :  TraitC-  etc.    §  402. 
*»Abel:  Oeuvres  completes,  I,  No.  XI;  p.  114-140. 


THE  ABELIAN  EQUATIONS.  211 

For  from  0x0a(x)  =  0Jx(x)  follows  also 

e;%{x)  =  O^O^x)]  ■   Olet[0l{x)']  =  OJcix);.  .  . 

The  equation  c,  =  R(<px)  shows  that  6)  has  in  the  present  case  also 
the  property  that  its  roots  are  all  rational  functions  of  a  single  one. 
We  write  now  accordingly 

Pa  =  '*a(Pl)        (a  =  l,2,...w) 

Then 

».(?,)  =  <Pa  =  Xa+d(xa)  +  0\xa)  +    •   •   • 

=  oa(x1)  +  o(oa(x1))  +  e2{oa(xl))+..., 
KMvd  =  OJPuM )  +  0&a%{xx))  +  ^.(^(a,))  +  .  .  . 

so  that  the  operations  »V  are  again  commutative,  like  the  O's.  The 
equation  0)  is  therefore  itself  an  Abelian  equation,  the  degree  of 
which  is  reduced  to  the  mth  part  of  that  of  1 ). 

We  can  then  proceed  further  in  the  same  way  until  we  arrive  at 
equations  of  the  type  treated  and  solved  in  §  174. 

£  182-.  The  character  of  a  group  of  an  Abelian  equation  is 
readily  determined  as  follows: 

Suppose  that  any  two  substitutions  s  and  t  of  the  group  replace 
an  arbitrary  element  xx  by 

x,  =  02(xx),     xz  =  0z{xx), 

respectively.     Then  st  and  ts  replace  .t\  by 

0A(xx),    0zO2(xx\ 

respectively.     But  since  by  assumption  0.J>.A(X\)  =  0302(#i  )>  it  follows 

that 

st  —  ts. 

All  the  substitutions  of  the  group  are  therefore  commutative. 

If  conversely  the  group  G  of  an  equation  f(x)  =  0  consists  of 
commutative  substitutions,  we  consider  first  the  case  where  G  is 
intransitive  and  f(x)  is  accordingly  reducible  (§  156).  Suppose 
that 

A*)  =  /i(«0/.(*).-. 

where  fi(x),f2(x),  .  .  .  are  rationally  known  irreducible  functions. 
If  we  consider  the  roots  of  /,(•»')  =0  alone,  every  rationally  known 


"J 12  THEORY    OF    SUBSTITUTIONS. 

function  of  these  is  unchanged  by  the  group  0  and  conversely. 
Accordingly  we  obtain  the  group  G,  belonging  to/,(;c)=0  by 
simply  dropping  from  all  the  substitutions  *, .  s2,  s8,  ...  of  G  those 
elements  which  are  not  roots  of  f(x)  =  0,  and  retaining  among  the 
resulting  substitutions  <ru  <r2,  ff3,  .  .  .  those  which  are  distinct.  It  is 
clear  that  from  8aSp-=Sp8a  follows  also  <ra<7s  =  "^a-  The  group  of 
every  irreducible  factor  of  f(x)  is  therefore  itself  composed  of  com- 
mutative substitutions,  and  is  moreover  transitive. 

We  may  therefore  confine  ourselves  to  the  case  where  G  is  a 
transitive  group.  If  now  G  contains  ;i  substitution  8n  which  leaves 
,i\  unchanged  and  replaces  x2  by  x3,  then  if  we  select  any  substi- 
tution s>  of  G  which  replaces  .«■,  by  x2,  we  have 

.s,.s\  =  I  .<•,.(-, ...  ),      ,s,s,  =  (x}x8  .  .  .  ). 

This  being  inconsistent  with  the  commutative  property  of  the  group, 
it  follows  that  every  substitution  of  G  either  affects  all  the  elements, 
or  is  the  identical  substitution. 

If  now  any  arbitrary  root  «r,  of  /(  x)  =  0  is  regarded  as  known, 
the  group  of   the  equation  reduces  to  those    substitutions  which 
leave   .r,    unchanged,    i.    e.,   to  the    identical    substitution.      Co;; 
quently  every   function  of  the  roots   is   then  rationally  known;  in 
particular  x2,  ■• '.. .  •  .  ■  are  rational  functions  of  .r,, 

.<■.      »,i  '\  ).     xa  =  03(x1),... 
Again,  if  sa  and  Sp  replace  .r,  by  xa  =  0a(x1)    and   x^  =  0fi(.rl) 
respectively,  then  sasp  and  s^sa  replaces  .»-,  by  ^(ac,)  and  Ofi0a(xj  ). 
and.  as  saSp  —  SpSa,  the  operations  0  are  also  commutative. 

Theorem  XII.  The  substitutions  of  the  (/roup  of  an  Abe- 
lian  equation  are  'ill  commutative.  Conversely,  if  the  substitutions 
of  the  group  of  an  equation  are  all  commutative,  the  irreducible 
factors  of  the  equation  arc  all  Abelian  equations. 

£  183.     The  substitutions  of  the  groupof  an  Abelian  equation, 

as  well  as  the  relations  between  the  roots,  therefore  fulfill  the  con- 
ditions assigned  in  the  investigations  of  §§  L37   139. 

In   particular  we  can  arrange  the  roots  in  the  following  system 

t>i'<ti  !'J>,?  ...  "/'(•'•■)     (fr<  =  0,  1,2,  ...*,— 1),. 

ii.ii  .a  |  .  .  .  nk  =  )>, 


THE  ABELIAN  EQUATIONS.  213 

in  which  every  root  occurs  once  and  only  once.  The  numbers 
»!,  n2,  .  .  .  nk  are  such  that  every  one  of  them  is  equal  to  or  is  con- 
tained in  the  preceding  one,  and  that  they  are  the  smallest  numbers 

for  which 

01»(x1)  =  x1,  l)  =  Xl,...0>u*(xl)  =  xl, 

respectively.  There  is  only  one  substitution  of  the  group  of  the 
equation  which  converts  .r,  into  0a{x^).  Denoting  this  by  sa,  we 
can  arrange  the  substitutions  of  the  group  also  in  a  system 

s,**,**,*" .  .  .  S***     (hi  =  0, 1,  2.  .  .  .  nt—  1). 

Hiii,n3  .  .  .  nk  =  n, 

where  again  every  substitution  occurs  once  and  only  once,  and  cor- 
responding to  the  properties  of  the  #'s, 

s1"i  =  l,     */'-  =  l sfcB*  =  l. 

The  numbers  »,,  n.,,  .  .  .  nh  are  the  same  as  those  for  the  fl's. 
To  form  a  resolvent  we  take  now 

*t(«a)  =  2  °'':l>>  ■  ■  ■  <rH-Cl)     (hi  =  °' *'  •  •  •  Ui  _  1} 

*S  i  *8 1  •  •  •  hh 

and  construct  the  cyclical  function 

xfa)  =  [W^)  +  "xeM*i)  +  <e?^*x)  +  •  •  •  +<KlWH*i)Y\ 
where  w,  is  a  primitive  w,th  root  of  unity.  Then  %i(x^)  is  unchanged 
by  the  group  of  the  equation.  For  the  substitutions  of  the  sub- 
group 

Gr.j  =  -)  s2,  s3 ....  s 

leave  ^'i(#i)  unchanged,  and  the  powers  of  st  convert  ^(.r,)  into 

respectively,  so  that  these  do  not  affect  the  value  of  /, .  Conse- 
quently Xi  ls  rational  in  the  coefficients  of  the  given  Abelian  equa- 
tions and  in  «.  From  Theorem  IV,  c'1,  is  therefore  a  root  of  a 
"simplest  Abelian  equation"  of  degree  nt.  With  c'',  all  the  func- 
tions which  belong  to  the  subgroup  (l.  of  G  are  also  rationally 
known. 

Again,  if  we  take 

v\ ; 2(Xl)  =  ^ "■''■<"*"*  ■  ■  ■  B*"  (**  =  0, 1, . . .  nt -  1), 

ftg,...A* 


2  1  1  THEORY    OF    SllISTITUTIONS. 

and  form  the  cyclical  resolvent 
Xi,  .(•''.)  = 

I ft ,  _<•'•,  I  +  »a  ft ,  .(«i )  +  «»Vft ,  ,<>■'>  +  • .  •  +  <■  V«  V, ,  ,(«0JS 

in  which  w2  is  a  primitive  h.,11'  root  of  unity,  the  function  /,  _,(.<•,)  is 
unchanged  by  the  group  G.,,  and  is  therefore  a  rational  function  of 
ft  ■     For  the  substitutions  of  the  group 

leave  0, , ,  unchanged  and  the  powers  of  s._.  convert  ft  1 2  into 

0,ft   2      "A'1,    -   .  .  .6^-tyi 

respectively.  Applying  Theorem  IV  again,  we  obtain  ft>a  from  ft 
by  the  solution  of  a  second  simplest  Abelian  equation  of  degree 
a .. 

In  general,  if  we  write 

Vl,8,...  V—  ^   £j     >■  .   I  ...     /,      ^ij, 

#1,2, ...  K  = 

[^I2,...»+'»MlJ|...,+'»AVi121...,T...+<'  '"/"•V',,,,...*']'"', 

the  value  of  ftf2,...v  is  determined  from  that  of  the  similar  func- 
tion 

ib  =  ^S  ^  *v         e  hiA  r  ) 

Y\,2,...v-\  —     Xj     v        •••      kk\->-\)- 

I'v  .  .  .  I'k 

by  the  aid  of  a  simplest  Abelian  equation,  as  defined  by  Theo» 
rem  IV. 

By  a  continued  repetition  of  this  process  we  obtain  finally  * 

Theorem  XIII.     If  the  n  roots  of  an  Abelian  equation  are 

defined  by  the  system 

i*<i .'.  .  efc**i>,)     (/*,-  =:  0,  1,  2,  .  .  .  n{—  1) 

the  solution  of  the  equation  can  be  effected  by  solving  successively 
k  "simplest"  Abelian  equations  of  degrees 

nl,n2,nz,  .  .  .  nk. 

*L.  Kronecker:  Berl.  Ber.,  Nachtrag  z.  Dezembcrheft,  1877;  pp.  846-851. 


THE  ABELIAN  EQUATIONS.  215 

§  184.  The  solution  of  irreducible  Abelian  equations  can  also 
be  accomplished  by  another  method,  to  which  we  now  turn  our 
attention. 

Theorem  XIV.  The  solution  of  an  irreducible  Abelian 
equation  of  degree  n  =  pl"ip.,a^  .  .  . ,  where  Pi,p>,  .  .  .  are  the  differ- 
ent prime  factors  of  n,  can  be  reduced  to  that  of  k  irreducible  Abe- 
lian equations  of  degrees  jVS  iV%  •  •  • 

The  proof  *  is  based  on  the  consideration  of  the  properties  of 
the  group  of  the  equation.     For  simplicity  we  take  n  =  Piaip2a--. 

Since  the  order  of  the  group  is  r  =  n,  the  order  of  every  one  of 
the  substitutions  is  a  factor  of  n,  and  is  therefore  of  the  form 
Pi"llh"--  Every  substitution  of  the  group  can  accordingly  be  con- 
structed by  a  combination  of  its  (p2a-)th  power,  (which  is  of  order 
pfi)  and  its  (p^)th  power  (which  is  of  order  p2b").  Consequently  we 
can  obtain  every  substitution  of  the  group  G  by  combining  all  the 

t'    f    f  f 

the  orders  of  which  are  a  power  of  pv ,  with  all  the 

/"    /"    t"  t" 

the  orders  of  which  are  a  multiple  of  p.,.  Since  the  Vq  are  all  com- 
mutative, the  substitutions  of  G  are,  then,  all  of  the  form 

The  order  of  the  product  in  the  first  parenthesis  is  a  power  of  px , 
and  therefore  a  factor  of  p1a\.     For  we  have 

Two  substitutions  . 

{t'at'p...  )(W«,..),     (t'j'b...)(t"dt"e...) 

are  different  unless  the  corresponding  parentheses  are  equal  each  to 
each.     For  if  the  two  substitutions  are  equal,  we  have 

(t'J'p  ...)  (t'J'b  ...)-'=  (t"*t"<  ■  ■  .)-\t"dt"e  .  .  .), 

and  since  the  order  of  the  left  hand  member  is  a  divisor  of  px\  and 
that  of  the  right  hand  member  a  divisor  of  p2a-,  each  of  these  divi- 
sors is  1. 

•O.  Jordan;  Trait6  etc.  §  405-407. 


21G  THEORY    OF    SUBSTITUTIONS. 

The  number  of  substitutions  ,s  is  equal  to  n  =  p,ai  pa"«.  And 
since  the  substitutions  if  form  a  group  and  every  substitution  of  this 
group  is  of  order  p,"*!,  the  order  of  the  group  itself  must  be  />,'">, 
(§  43).  Similarly  the  order  of  the  group  formed  by  the  t'n&  is 
equal  to  p"'-.     It  follows  then  from 

n  =  pfp.f*  =  p"'xp2'n- 
that  Wj  =  «, ,  m^  =  a  2 . 

Suppose  now  that  <p  is  a  function  belonging  to  the  group  of 
the  t"  's.  Then  tp  has  ptai  values,  and  is  the  root  of  an  equation 
of  degree  p,ai  the  group  of  which  is  isormorphic  with  the  group 
of  the  tn&.     This  is  therefore  an  Abelian  equation. 

Similarly  the  function  <f>  belonging  to  the  group  of  the  t'  's  is  a 
root  of  an  Abelian  equation  of  degree  p2a^. 

If  now  <p  and  4'  have  been  determined,  the  function 

x  =  a'<p  -f-  ,:-\" 

belongs  to  the  group  1.  Every  function  of  the  roots,  and  in  particu- 
lar the  roots  themselves,  are  rational  functions  of  /,  and  the  theorem 
is  proved. 

§  185.  Theorem  XV.  The  volution  of  an  irreducible  Abe- 
lian equation  of  degree  pa  can  be  reduced  to  that  of  a  series  of 
Abelian  equations  the  groups  of  which  contain  only  substitutions  of 
order  p  and  the  identical  substitution. 

If  G  is  the  group  of  such  an  equation,  the  order  of  every  sub- 
stitution of  G  is  a  power  of  p.  Suppose  that  pK  is  the  maximum 
order  of  the  substitutions  of  G.  Then  those  substitutions  which  are 
of  orders  not  exceeding  pk  ~~ '  form  a  subgroup  H  of  G.  For  if  tt 
and  t.j  are  two  of  these  substitutions,  then  from  the  commutative 
property  it  follows  that 

(t1t2)'>x-l^tl^'it/^l  =  l, 

so  that  txU  is  also  of  order  not  exceeding  pK    '. 

If  the  group  H  is  of  order  p",  any  function  <p  belonging  to  // 
will  take  pa~"  values  and  will  therefore  satisfy  an  equation  of 
degree  pa~".  If  we  apply  to  <p  the  successive  powers  of  any  sub- 
stitution t  of  G  which  does  not  occur  in  H,  <p  will  take  only  p  values, 
since  rF  is  contained  in  H.     The  substitutions  among  the  values  of  <p 


THE    ABELIAM    EQUATIONS.  21  i 

which  are  produced  by  the  substitutions  of  G,  and  which  form  a 
group  isomorphic  to  G,  are  therefore  all  of  order  p.  From  the  iso- 
morphism of  the  two  groups  it  follows,  as  in  the  preceding  Section, 
that  the  equation  for  <p  is  an  Abelian  equation. 

If  c-  is  known  the  group  G  of  the  given  Abelian  equation  reduces 
to  H.  We  denote  the  grotip  composed  of  those  substitutions  of  // 
which  are  of  order  pK~2  or  less  by  if,.  If  cr,  is  a  function  belong- 
ing to  Ht,  then  cr,  is  determined  from  <p  by  an  Abelian  equation  of 
degree  p"~r'i,  the  group  of  which  again  contains  only  substitutions 
of  order  p,   and  so  on. 

§  186.     Theorem  XVI.      The  solution    of   an    irreducible 

Abelian  equation  of  degree  pa,  the  group  of  which  contains  only 
substitution*  of  order  p  and  the  identical  substitution,  reduces  to 
that  of  a  irreducible  Abelian  equations  of  degree  p. 

Although  this  Theorem  is  contained  as  a  special  case  in  that 
obtained  in  §  183,  we  will  again  verify  it  by  the  aid  of  the  method 
last  employed. 

Let  s,  be  any  substitution  of  the  group  G  of  the  given  Abelian 
equation;  then  the  order  of  s,  is  p.  Again  if  s2  is  any  substitution 
of  G  not  contained  among  the  powers  of  s, ,  then  since  s,  s2  =  s2s} ,  the 
group  H  =  \  Sj ,  s2  j  contains  at  the  most  p2  substitutions.  It  will 
contain  exactly  this  number,  if  the  equality  s{'sb  =  s^sf  requires 
that  a  =  a,  b  —  fi.  But  if  sfsf  —  sfsf,  then  s," ~a  =  s/~b,  and  for 
every  value  of  ,5 — b  different  from  0  we  can  determine  a  number 
m  such  that 

m(,5  —  tV)  =  l      (mod.  }>)■ 
It  follows  then  that 

s.,  =  s.rp-b)  =  s1m(a-a\ 

which  is  contrary  to  hypothesis.     Accordingly  /S  =  b  and  a  =  a. 

If  a  >  2,  suppose  that  s3  is  a  substitution  of  G  not  contained 
among  the  p1  substitution  s{'s.!'.  Since  s,s3  =  s3sx  and  s2s3  =  s3s2 , 
the  group  Hz  =  -J.s,,  s33  s3  (•  contains  at  the  most  p3  substitutions. 
And  it  contains  exactly  this  number,  for  if  s, "s.bs{  =  s^s/s^,  then 
s3y~e  =sl"~as2b~P,  and  so  on,  as  before. 

Proceeding  in  this  way,  we  perceive  that  all  the  substitutions  of 
G  can  be  written  in  the  form 

s^sA  .  .  .  saXa,     (Xt  =  0, 1, . . .  p — 1)      • 


218  THEORY    OF    SUBSTITUTIONS. 

where  every  substitution  occurs  once  and  only  once  (cf.  §  183).     If 
now  we  take  for  the  resolvents  and  the  corresponding  groups 

Va        '  ''"l  ?  •'".'  ?    •  •   •  •'">! )  i        '•■   a  -   \  ,s'l  5  ,<?J  <   •  •   •  ''''a      1  (  5 

Pa      1'  '''1  )  ■'  :i    ■  •   ■  ■>',i)  '1        "a-     1  —   '1  -S'l  >  ®2j   •   •   ■  ®a      2  J  ,s'a  i  • 


P]         '    'm  '''j '"..')        -"    1  —    '('S-'  S^1   '   '   '  ®»J  I 

then  every  resolvent  depends  on  an  Abelian  equation  of  degree  p. 
The  roots  of  the  given  equation  of  degree  pa  are  rational  functions 
of  Pi>  Pi'>  ■  ■  -fai  for  the  function 

4>  =  ft  P]  +  ft  Pi  +  •  •  •  +  0a  Pa 

belongs  to  the  group  l(c/.  §  177). 

£  187.     The  pa  roots  of  such  an  equation  may  be  denoted  by 

.     **,,**,...*„      (**  =  0,l,2»...p— 1) 

Suppose  that  #$,,&,.„  £a  is  the  root  by  which  s/i.s/s .  .  .  sa^°  replaces 
xz,  .  .     Then  the  substitution 

Sj^s2^2 .  .  .  sja  ■  s^s.^- .  .  .  sja  =  s1^  +  £>s2&+&  .  .  .  sj"-+ to- 
by virtue  of  the  left  hand  form  will  replace  .r.,  iC,,...  „a  by  the  root 
by    which    sj'sfi . . . sja   replaces    #&,&,...  £tt.      -^u^  ^rom  ^e  right 
hand   form    this    root  is   ^.+|,  ,^  + f, ...  ^a+fa-      Consequently  every 
substitution  sfisj*  .  .  .  sja  replaces  any  element  #£,,&,...$„  by 

»&  +  *!,     &  +  &,.-.  Sa  +  £a> 

that  is  the  substitutions  of  the  group  are  defined  analytically  by  the 
formula 

•V'.s/'-' .  .  .  sa*«  =  |  2j ,  z2 . . '.  za     zx  +  kx ,  z2  +  fc2, . . .  za  +  fca |     (mod. p). 

77te  group  of  an  Abelian  equation  of  degree  pa,  the  substitutions 
of  which  are  all  of  order  p,  consists  of  the  arithmetic  substitutions 
of  degree  j>a  (mod.  p). 

§  188.  Finally  we  effect  the  transition  from  the  investigations 
of  the  present  Chapter  to  the  more  special  questions  of  the  preced- 
ing one. 

2-' 

Let  n  be  any  arbitrary  integer  and  let  the  quotient  —  be  denoted 

by  a.      Then,  as  is  well  known,  the  n  quantities 


THE    ABELIA.N    EQUATIONS.  219 

cos  a,    cos  2a,    cos  da,  ...  cos  na 
satisfy  an  equation,  the  coefficients  of  which  are  rational  numbers, 

C)  .r"~  \  noc"    J  +  ,',,  ^~^a;"-*—  ...=0. 

If  now  we  write  x=  cos  a,  then  for  every  integer  m 

cos  m  a  =  v(cos  a) , 

where  d  is  a  rational  integral  function.  Similarly  if  the  value 
cosi^a  is  denoted  by  dfaosa),  we  obtain,  by  replacing  a  by  m^a  in 
the  last  equation,  the  result 

cos(mniia)  =  tticosm^a)  =  B61  {cos  a) 

Again  if  in  the  equatioL  J(cosa)  =  cos(m1a)  the  argument  a  is 
replaced  by  ma,  the  result  is 

cos^n^na)  ==  6i(cosma)  =  0,# cos  a. 

Consequently  the  roots  of  C)  are  so  connected  that  every  one  of 
them  is  a  rational  function  of  a  single  one  among  them,  x,  and  that 

0i0(.r)  =  dt)i(x)     (x  =  cos  a) . 

The  equation  C)  is  therefore  an  Abelian  equation.     Accordingly 

2- 
x  =  cos  a  —  cos  — 
// 

can  be  algebraically  obtained.     We  have  here  an  example  of  §  181. 

§  189.     Suppose  now  that  n  is  an  odd  prime  number,  n  =  2*  -f~  L 
Then  the  roots  of  the  equation  C)  are  the  following*: 

2^  4r  4v* 

r0S27+l'     r0*27+l'---C0S2T+l'  ' 

Since  the  last  root  is  equal  to  1,  the  equation  C)  is  divisible  by  x —  1. 
The  other  roots  coincide  in  pairs 

2m~     _  cos  (2v  -f- 1 —  m)2- 

cos27+i.~~    '  2v+i     ~* 

Consequently  we  can  obtain  from  C)  an  equation  with  rational 
coefficients,  the  roots  of  which  will  be  the  following 

2-  4-  2v7T 

COS  « r~r ,      cos  - — —  ....  cos  ■ 


2v  +  V  2>  +  l' 2v  +  l' 

This  equation  is  of  the  form 


220 


THEORY    OF    SUBSTITUTIONS. 


CM  .«•      I,'    '+4(,_i)a--»_Kv_2)»'   '  +  A^     M"     3s'    ' 

(y-3)(v-4)  _ 

1  ■  D 

With  the  notation 

'2- 
cos  =  cosa—  x 

2>  -\-  1 

we  have  then 

2m-  .  . 

cos  =  ti(x)  =  cos  m  a, 

80  that  the  equation  CJ  has  also  the  roots 

),  tr(x),  ^(a>),  .  .  . 


that 


18 


cosa,     cosma,     cosnra,     cosm3a, .  .  .cosmfa,  . . . 


If  now  g  is  any  primitive   root   (mod.  2v  -f-  1 )   then  the  v  terms  of 
the  series 

-Ri)  cosa,     cosga,     cos  (fa,  .  .  .  cosg"~*  a, 

are  distinct,     For  from  the  equation 

cos  ga  a  —  cos  gB  a     (a  >      ;  a,     <  >) 

it  would  follow  that 

or,  replacing  a  bv  its  value      ""     , 

2v  + 1 

17a  T  ^  =  flr* ({?a"^  1)  =  fc(2w  +  1 ,). 

Dividing  both  sides  of  this  equation   by  gP,    and  multiplying  by 
ga  -p  _j_  ^  we  0^tain  the  congruence 

i-»===l     (mod.  2>  +  l). 

But,  since  since  2(«  —  /?)  <  2v,  this  congruence  is  impossible.     Con- 
sequently cosgaa  is  different  from  eosg^a. 

Again 

cosg'a  —  cos  <i. 

For  since  gr2"-0 — 1  =  (gv  —  l)(gv+\)  is  a  multiple  of  2^  +  1,  one 
of  the  two  factors  is  divisible  by  Zv  -(-  1  ,  so  that 

flf=±l  +  *(2n  +  l), 

and  consequently  the  relation  hold-, 


THE    ABELIAN    EQUATIONS.  221 

cosgva  =  cos[±  14-  /.  (2:    f-  l)]a  =  cos(±  a+  2/;-)  =  cos  a . 

It  follows  then  that  the  v  roots  of  the  equation  C, )  are  all  contained 
in  the  series  Rx),  or  again  in  the  series 

■  r.  ni.r).  #{x\  .  . .  er-  l(x), 

while  dv(x)  =  1.  The  equation  C,)  can  therefore  be  solved  algebrai- 
cally.    We  have  an  example  of  §  174. 

If  we  have  v  =  nt »,  .  .  .  »w.  it  appears  that  we  can  divide  the  cir- 
cumference of  a  circle  in  2v  -+- 1  equal  parts  by  the  solution  of  u> 
equations  of  degrees  nlt  n2,  . . .  ww.  If  nl5  »..,  . . .  nu  are  prime  to 
each  other,  the  coefficients  of  these  equations  are  rational  numbers. 
(§176). 

In  particular  if  v  =  2™,  we  have  the  theorem  on  the  construction 
of  regular  polygons  by  the  aid  of  the  ruler  and  compass. 


J 


CHAPTER    XII. 


EQUATIONS    Willi    RATIONAL   RELATIONS   BETWEEN 

THREE    ROOTS. 

£  100.  The  method  employed  in  £  1S:>  is  also  applicable  to  other 
cases.  "We  will  suppose  for  example  that  all  the  substitutions  of  a 
transitive  group  G  are  obtained  by  combination  of  the  two  substitu- 
tions Sj  and  s2,  which  satisfy  the  conditions  1  |  that  the  equation 
sf  =  sf  holds  only  when  both  sides  are  equal  to  identity,  and  2) 
that  .SjS,  —  .s/.v.  (('/.  §  :]~t).  If,  then,  the  orders  of  s,  and  s2  are  », 
and  n.,,  all  the  substitutions  of  G  are  represented,  each  once  and 
only  once  by 

s,*ia2*«     (ft,  =  Q,l,2,  ...  n.       1). 

Suppose  now  that  G  is  the  group  of  an  equation  f(x)  =  0.  We 
construct  a  resolvent  tp  —  </'o  belonging  to  the  group  1,  s, ,  s,2,  .  .  .  s,"1  ', 
and  denote  the  functions  which  proceed  from  <,'•„  on  the  application 
of  s2,  s22,  .  .  .  '   by   </',,</'_..  .  .  .  c'„      ,.     Then  all  these  v'r's  belong 

to  the  same  group  with  c'v     For  from  s2s,  =  8*s2  we  have 

f*  S^SiS^        —  Si  ,       So."]  S2  —  -s'|     •   •  •  • 

from  which  it  follows  at  once  that  the  powers  of  s,  form  a  self  con- 
jugate subgroup  of  G.     The  resolvent 

*=[>„  + «,<*!  +  <«2V2 +...<*    V„,    ,]"■ 

is  therefore  unchanged  by  every  *,",  and  since  sa  permutes  the  c  *s 
cyclically,  /  remains  unchanged  by  all  the  substitutions  of  the  group, 
and  can  be  rationally  expressed  in  terms  of  the  coefficients  of /(.n. 
We  can  therefore  obtain  <:„. «.',....  by  the  extraction  of  an  >/,"'  root, 
as  in  the  preceding  Chapter.  The  group  of  the  equation  then  re- 
duces to  the  powers  of  8} ,  and  the  equation  itself  becomes  a  simplest 
Abelian  equation. 

8  191.  Again,  if  a  transitive  group  consists  of  combinations  of 
three  substitutions  s,  ,s.,,s3,  for  which  1)  the  equations 


RATIONAL    RELATIONS    BETWEEN    TIIREE    ROOTS.  228 

are  satisfied  only  when  both  sides  of  each  equation  are  equal  to 
Identity,  and  2)  the  relations  hold 

S&  —  S^Sjj,    83S]  =  S^S/Sg,    SaSj,  =  n,°V-s'  . 

then  all  the  substitutions  of  the  group  are  represented,  each  once 
and  only  once  by 

SlV2V      (fc.-  =  0,  1,2.  ...  n{— 1), 

where  »,,  n2,  //.;  are  the  orders  of  Si,s2,  s3.  If  now  G  is  the  group 
of  an  equation,  we  can  show  by  precisely  the  same  method  as  before, 
that  the  equation  can  be  solved  algebraically. 

Obviously  we  can  proceed  further  in  the  same  direction.  That 
groups  actually  arise  in  this  way  which  are  not  contained  among 
those  treated  in  the  last  Chapter  is  apparent  from  the  example  on 
p.  39,  where  s2s,  =  *,%. 

§  192.  Returning  to  the  example  of  §  190,  we  examine  more 
closely  the  group  there  given.  If  we  suppose  s2  to  be  replaced  by 
its  reciprocal,  it  follows  from  the  second  condition  that  s.,_,s,.So  =  Sjfc. 
From  sl  we  can  therefore  obtain  every  possible  s.,  by  the  method  of 
§  40.  We  have  only  to  write  under  every  cycle  of  s,  a  cycle  of  8* 
of  the  same  order,  and  to  determine  the  substitution  which  replaces 
every  element  of  the  upper  line  by  the  element  immediately  belowT 
it.     This  substitution  will  be  one  of  the  possible  s2's. 

We  consider  separately  the  two  cases  1)  where  s,  consists  of  two 
or  more  cycles,  and  2)  where  .Sj  has  only  one  cycle. 

In  the  former  case  the  transitivity  of  the  group  is  secured  by  s2. 
Consequently  every  cycle  of  s,A"  must  contain  some  elements  different 
from  those  of  the  cycle  of  Sj  under  which  it  is  written.  It  is  clear 
also  that  all  the  cycles  of  s,  must  contain  the  same  number  of  ele- 
ments. Otherwise  the  elements  of  the  cycles  of  the  same  order 
would  furnish  a  system  of  intransitivity.  The  order  of  the  cycles 
can  then  obviously  be  so  taken  that  the  elements  of  the  second  cycle 
stand  under  those  of  the  first,  those  of  the  third  under  those  of  the 
second,  and  so  on,  so  that  with  a  proper  notation  the  following  order 
of  correspondence  is  obtained 


22  \  THEORY    OJ'    SUBSTITUTIONS. 

S,=  {xtX2      ./•  .  .  .  )(//,//       //.,  ...)... 

•s/'  =  (Z/i2/i  :  a/7i  (-*•  ••)(-!-!     fc*i +*•••)••■ 

It  follows  then  that 

i 

n    =(37,^2,  .  .  .  )(.r,//,  ';  ,.:  ...)... 

The  group  is  therefore  non-primitive,  the  systems  of  non-primitivity 
being  .<-,.  .<-.,  ...;//,,  //_,,  .  .  .;  zn  .1,,,  .  .  .  The  substitutions  ,s,a  leave 
the  several  systems  unchanged,  the  substitutions  s1as2  permute  the 
systems  cyclically  one  step,  sfsj*  two  step  and  so  on.  Accordingly 
every  substitution  of  the  group  except  identity  affects  every  element. 
The  group  is,  in  fact,  a  group  !-'  (§  129). 

The  adjunction  of  any  arbitrary  element  X\  reduces  the  group  to 
the  identical  substitution.  Consequently  all  the  roots  are  rational 
functions  of  any  one  among  them. 

The  following  may  serve  as  an  example: 

S,  =  l.r,.r,.--:,  (//,//_//.),       S2  =    {x  //I  |  '•//)  (..//,), 

s2s1  =  (x1y2)  {x2yx)  (xsy3)      s 

£  L93.  In  the  second  case,  where  s,  consists  of  a  single  cycle, 
the  transitivity  is  already  secured.  We  may  write  then,  as  in  Chap- 
ter VIII, 

-\Z      '2  4-  1     . 

To  construct  the  s2's  we  proceed  as  before  and  obtain  from 

the  scries  of  substitutions 

s2  —  ;  z     kz  -\-i  —  k\,     s/=  z     kH  -  i  i     k)\. 

tC  —  1 

Now.  in  the  hrst  place,  it  is  easily  shown  that  the  group  contains 
substitutions  different  from  identity,  which  do  not  affect  all  the  ele- 
ments. For  among  the  powers  of  *,  there  is  certainly  one  ^,M  which 
has  a  sequence  of  two  elements  in  common  with  s2.  Then  n^.s,  ' 
does  not  affect  all  the  elements. 

Again,  it  can  be  shown  that  there  is  no  substitution  except  iden- 
tity which  leaves  the  elements  unchanged.     For  we  have 

k?  —1 

8faf  =  \z      kHz  +  a) -{----         1/        /.,, 

k~  1 


RATIONAL    RELATIONS    BETWEEN    THREE    ROOTS. 


225 


and  if    ,t\    and   a*A  +  1   were    not   affected  by  the    substitution   we 

should  have 

A-*3  —  1 

#(j +  !  +  «)+_ ±(i—k)=X  +  l, 

and  consequently 

/C" .        J.  . 

The  substitution  then  becomes 

s*sf  —  \z     z  +  a  | , 

and  since  .*>  and  .rA  +  ]  are  unchanged,  a=0,  aDd  the  substitution 
is  identity. 

The  following  is  an  example  of  this  type: 

s,  =  (x1x2x3xix5x&) ,     s2  =  {xxx._)  (a?3a?6)  04a?5) 

From  the  preceding  considerations  we  deduce 

Theorem  I.  //  the  group  of  an  equation  is  of  the  kind 
defined  in  §  190,  all  the  roots  of  the  equation  are  rational  functions 
of,  at  the  most,  two  among  them,  and  the  equation  is  solvable  alge- 
braically. 

£  194.  We  turn  now  to  the  converse  problem  and  consider 
those  irreducible  equations,  the  roots  of  which  are  rational  func- 
tions of  two  among  them: 

If  any  substitution  of  the  group  G  of  such  an  equation  leaves 
.<■,  and  .r,  unchanged,  it  must  leave  every  element  unchanged. 
Again,  if  .sa  and  s'a  are  any  two  substitutions  of  G  which  have  the 
same  effect  on  both  xt  and  .r_,,  then  s'asa^1  leaves  xx  and  x>  un- 
changed; consequently  s'aSarx  =  1,  and  s'a  =  sa. 

Suppose  now  that  the  substitutions  of  G  are 

s1 ,  s2 ,  s3 ,  .  .  .  s,. . 

There  are  n(n  —  1)  different  possible  ways  of  replacing  :r,   and    < 
from  the  n  elements  xt  ,x2,  .  .  .  xn.     If  any  one  of  these  ways  is 
not  represented  in  the  line  above,  let  t2  be   any  substitution  which 
produces  the  new  arrangement.     Then  the  substitutions  of  the  line 
15 


226  THEORY    OF    SUBSTITUTIONS. 

f  _..S',  ,    (..N.j.   r.N, .    .    .    .    I    .s 

will  replace  a?,  and  x.  by  pairs  of  elements  which  are  all  different 
from  one  another,  and  none  of  which  correspond  to  the  first  line. 
If  2r  is  still  </M"  - 1),  then  there  are  other  pairs  of  elements 
which  do  not  correspond  to  either  line.  If  t .  is  any  substitution 
which  replaces  .»■,  and  .r,  by  one  of  these  pairs,  we  can  construct  a 
third  line 

and  so  on  until  all  [the   n(n — 1)  possibilities  are  exhausted.     We 

have  therefore 

Theorem  II.  The  order  of  the  grouj)  of  on  irreducible 
■  quation  of  the  n"'  degree,  all  the  roots  of  ivhich  are  rational  func- 
tions of  two  among  them,  is  a  divisor  of  n(n  —  1 ). 

§  195.  The  equations  of  the  preceding  Section  are  not  yet 
identified,  however,  with  those  previously  considered  in  §  L90. 
This  will  be  clear  from]an*example.  The  alternating  group  of  four 
elements  contains  no  substitution  except  identity  which  leaves  two 
elements  unchanged.  For  such  a  substitution  could  only  be  a  trans- 
position of  the  two  remaining  elements.  Consequently  the  roots  of 
the  corresponding  equation  of  the  fourth  degree  are  all  rational 
functions  of  any^two  among  them.  But  the  group  cannot  be  writ- 
ten in  the  form 

for  it  contains  only  substitutions  of  the  two  types  (.<•,./•_..<•,)  and 
(./,.')  I '•'' ./'"().  s<>  that  the  orders  n,  and  n.,  can  only  be  2  and  3,  while 
rijWj  must  be  equal  to  12. 

§  196.  If  however,  the  degree  of  the  equation  of  §194  is  a 
prime  number  p,  we  have  precisely  the  case  treated  at  the  begin- 
ning of  the  Chapter. 

To  show  this  we  observe  that  by  Theorem  II,  the  transitive  group 
Q  of  the  equation  is  of  an  order  which  is  a  divisor  of  p(p —  I  >. 
Since  the  transitive  group  is  of  degree  p,  its  order  is  also  a  multi- 
ple of  p.  It  contains,  therefore,  a  substitution  s{  of  the  pth  order, 
and  consequently  also   a  subgroup  of  the  same  order.      If  now  in 

pip  — 1\ 
§  12S,  Theorem  I,  we  take   a  =  1,  and  put  for  r  the  order  —         -', 


• 


RATIONAL  RELATIONS  BETWBEH  THREE  BOOTS.  227 

it  follows  that  k=  0,  that  is,  G  contains  no  substitutions  of  order  i> 
except  the  powers  of  s, .  Consequently  we  must  have  82*1*2  '  =  */'• 
and  this  is  the  assumption  made  in  §  188. 

Equations  of  this  kind  were  lirst  considered  by  Galois,*  and 
have  been  called  Galois  equations.  We  do  not  however  employ  this 
designation,  in  order  to  avoid  confusion  with  the  Galois  resolvent 
equations,  i.  ■  ..  those  resolvent  equations  of  which  every  root  is  a 
rational  function  of  every  other  one. 

If  a  substitution  of  the  group  G  of  an  equation  of  the  pres- 
ent type  is  to  leave  any  element  .»•_,  unchanged,  we  must  have  from 

§193 

/J 1 

(kfi  —  l)z  +  akP  +  —     T(i—k)       0      (mod.//). 
A'  —  J_ 

Since  kP  —  1  is  either  0  I  mod.  p)  or  is  prime  to  p,  it  follows  that 
either  every  x  is  unchanged  and  the  substitution  is  equal  to  1,  or 
one  element  at  the  most  remains  unchanged. 

Theorem  III.  If  all  the  roots  of  an  irreducible  equation 
of  prime  degree  p  are  rational  functions  of  two  among  them,  the 
group  of  the  equation  contains,  besides  the   identical  substitution, 

p — 1  substitutions  of  order  p  and  substitutions  ivhich  affect  p  -1 
elements.  The  solution  of  the  equation  reduces  to  that  of  hvo 
Abelian  equations. 

£  197.  The  simplest  example  of  the  equations  of  this  type  is 
furnished  by  the  binomial  equation  of  prime  degree  p 

xp—A  =  0 

in  the  case  where  the  real  ptb  root  of  the  absolute  value  of  the  real 
quantity  A  does  not  belong  to  the  domain  of  those  quantities  which 
we  regard  as  rational. 

The  roots  of  this  equation,  if  xr  is  one  of  them,  are 

The  quotient  of  any  two  roots  of  the  equation  is  therefore  a  power 
of  the  primitive  pth  root  of  unity  <o.  A  properly  chosen  power  of 
this  quotient  is  equal  to  <■»  itself.  Consequently  if  any  two  roots 
v3  and  xy  are  given,  every  other  root  a\  is  defined  by  an  equation 

•Evariste  Galois:  Oeuvres  niathematiques,  edited  by  Liouvllle  id  Vol.  11  of  the 
rnal de mathdmatiques pui  IMC.   pp.381  11!. 


_"JS  TIIEORY    OF    SUBSTITUTIONS. 

that  is,  .ra  is  a  rational  function  of  x$  and  xy. 

As  soon,  therefore,  as  it  is  shown  that  the  equation 

xp  —  A  =  0 

is  irreducible,  it  is  clear  that  it  belongs  to  the  type  under  discussion. 

If  the  polynomial  xp —  A  were  factorable 

,vp  —  A  =  <fx(x)  cr2(.r)  .  .  .  , 

then,  since  p  is  a  prime  number,  the  several  factors  could  only  be 
of  the  same  degree,  if  they  were  all  of  degree  1.  The  roots  would 
then  all  be  rational.  Consequently  this  possibility  is  to  be  rejected. 
Suppose  then  that  ^(x)  is  of  higher  degree  than  <f2(x).  Let 
the  roots  of  <pj(x)  and  <p2(x)  be 

<fl\X)  \        X  j  ,  X  o  ,  X  3  ,   .   .  .  X  „j  , 

c\,( xj ;     x  j ,  x  o  i  x  3 ,  .  .  .  x  „„ . 
Then  the  last  coefficient  of  each  of  the  polynomials  cr,  and  <f2 

±x\  x\  x\  ...  =o»»iap1*iJ 

±x",x",x"z...=o>°>x^,     <"■>  >"■-■> 

and  consequently  their  quotient 

±  wT.r/",     (m  >  0) 

is  rational  within  the  rational  domain.  Since  p  is  a  prime  number, 
it  is  possible  to  find  an  integer  //.  such  that  the  congruence 

or  the  equation 

///,"  =  vp-\-] 

shall  be  satisfied.     Then  the  quantity 

(±x1'"ojtY=  ±xvp+1w'lT=  ±  A"a;1a*'4T==  ±  A'..'. 

and  consequently  ./,  is  rational.  From  the  reducibility  of  the 
e< piation  would  therefore  follow  the  rationality  of  a  root,  which  is 
certainly  impossible. 

The  group  of  the  equation  is  of  order  p(p —  1).  For  if  we  leave 
one  root  xt  unchanged,  any  other  root  <".r,  can  still  be  converted 
into  any  one  of  the  p  —  1  roots  ioxlt  <"'.<,,  u?X\  .  .  .  wp~1X1. 


RATIONAL    RELATIONS    BETWEEN    THREE    ROOTS.  229 

Theorem   IV.      The  binomial  (-(/nation 

xp—A-0. 

in  which  A  is  not  the  ptb  'power  of  any  quantity  belonging  to  the 

rational  domain,  belongs  to  the  type  of  §  196.     Its  group  is  of  order 
p(p  —  l). 

§  198.  Remark.  By  Theorem  III  every  irreducible  equation 
the  roots  of  which  are  rational  functions  of  two  among  them  is  alge- 
braically solvable.  At  present  we  have  not  the  means  of  proving  the 
converse  theorem.  It  will  however  be  shown  in  the  following  Chapter 
by  algebraic  considerations,  and  again  at  a  later  period  in  the  treat- 
ment of  solvable  equations  by  the  aid  of  the  theory  of  groups,  that 
every  equation  of  prime  degree,  which  is  irreducible  and  algebrai- 
cally solvable,  is  either  an  equation  of  the  type  above  considered,  or 
an  Abelian  equation.  Before  we  pass  to  such  general  considera- 
tions, we  treat  first  another  special  case,  characterized  by  rational 
relations  among  the  roots  taken  three  by  three. 

§  199.  An  equation  is  said  to  be  of  triad  character,  or  it  is 
called  briefly  a  triad  equation,*  if  its  roots  can  be  arranged  in  tri- 
ads xa,  Xp,  xy  in  such  a  way  that  any  two  elements  of  a  triad  deter- 
mine the  third  element  rationally,  i.  c,  if  xa  and  Xp  determine  xy, 
Xp  and  xy  determine  xa ,  and  xy  and  xa  determine  xp . 

Thus  the  equations  of  the  third  degree  are  triad  equations:  for 

OC^  —j—  *X*<2    i~  *%*"£  —  ^i  • 

Of  the  equations  of  the  higher  degree,  those  of  the  seventh  degree 
may  be  of  triad  character.  In  this  case  the  following  distribution 
of  the  roots  xu  x2,  .  .  .  ,r7  is  possible: 

Xi ,  X2 ,  X3 ;      XliXiiX5]      Xl}X6,Xq',      .»'_,.  .»'_, .  .r,  :      .»•_,,  .c  .  ,r7: 
•^3  5  Xi  j  X-; ;     x3 ,  Xr± ,  x$ . 

If  the  degree  of  an  equation  is  n,  there  are  = — -  pairs  of  roots 

xa,xp.  With  every  one  of  these  pairs  belongs  a  third  root  xy. 
Every  such  triad  occurs  three  times,  according  as  we  take  for  the 
original  pair  of  roots  xa,  Xp;  Xp,xy;  or  xy,xa.      There  are  there- 

fore   ^ — -  triads,  and  since  this  number  must  be  an  integer,  it 


1  Noether:  Math.  Ann.  XV,  p.  8!). 


230  ihkiiky    OF     SUBSTITUTIONS. 

follows  that  the  triad  character  is  only  possible  when  »  =  6m  -\- 1  or 
»  =  Cym  -)-:'> .  The  case  it  ~  Vun  must  be  excluded,  because  ??  must 
be  an  odd  number,  as  appears  at  once  if  we  combine  a?,  with  all  the 
other  elements,  which  must  then  group  themselves  in  pairs. 

The  general  question  whether  every  »i  =  6m-f-l,  n  =  6m  +  3 
furnishes  a  triad  system  we  do  not  here  consider.  It  is  however 
easy  to  establish  processes  for  deducing  from  a  triad  system  of  )i 
elements  a  second  triad  system  of  2w  +  l  elements,  and  from  two 
triad  systems  of  />,  and  n .,  elements  a  third  system  of  n}  v.,  elements. 
From  the  existence  of  the  triad  character  for  n  =  3  follows  therefore 

that  for  n  =  7.  L5,  31, ... ;  9,  19,  39 ;  21,  43,  .  .  .      These  do  not 

however  exhaust  all  possible  cases.  There  are  for  example  triad 
systems  for   >i  =  13,  etc. 

§  200.  We  proceed  to  develop  the  two  processes  above  men- 
tioned. In  the  first  place  suppose  a  triad  system  of  n  elements 
.'■, .  .<•.,  .  .  .  x„  given.  To  these  we  add  ra+1  other  elements  ./, . 
.i ■',.  .*'.. <•',..      We  retain  the  \n(n  -  -  1 )  triads  of  the  former  ele- 

ments,  and  also  cpnstruct  from  these  .         new  triads  by  accent- 

iisg  in  each  case  every  two  of  the  three  t's.  Finally  we  form  h 
further  triads  x0,  £»,, .»',;  o?0,  .*■',.  x\\    .  .  .  ,  and  have  then  in  all 

\„{n—  1)   ,  (2to  +  1)2m 

—6 f"  = 0^ 

triads,  which  furnish  the  system  belonging  to  the  2u  -f- 1  elements. 
For  example,  suppose  n  =  3.     We  obtain  then  the  following  sys- 
tem • 

.»•, ,  .r._, ,  .r.:     Xj .  '■    .  x  ;'.     x  , .  Xq .  •'■  ; '.     x   ■  x   .  ■>','.     .'',, .  .'■, ,  x  jj 

which  agrees,  apart  from  the  mere  notation,  with  the  triad  system 
for  seven  elements  established  in  the  preceding  Section. 

§  201.  Again,  suppose  two  triad  systems  of  degrees  ?/,  and  //.._,  to 
be  given.  The  indices  of  the  first  system  we  denote  by  <i .  I>,  <-,... , 
those  of  the  second  by  a,/?,  r,  . . .  We  may  designate  a  triad  by 
the  corresponding  indices.  Suppose  that  the  triads  of  the  first 
system  are 


RATIONAL    RELATIONS    BETWEEN    THREE    ROOTS. 

7\)  a,  b,  c;     a,d,e;     b,  d,g;   .  .  . 

and  those  of  the  second 


231 


T*) 


"■  p>  r; 


We  denote  the  elements  of  the  combined  system  by  xaa,  xap,  xba,  .  .  . 
and  form  for  these  a  triad  system  as  follows.     In  the  first  place,  we 
write  after  every  index  of  Tx)  the  index  a.     In  this  way  there  arise 
Hifoi—  1) 

In  the  same  way  we  write  ft,  then  y,  then   »,  .  .  .    after  every 
index  of  7Y).     We  obtain  then  in  every  case        —z—    -  and  in  all 


triads  of  elements  with  double  indices. 


6 


n 


6 


triads  of  the  elements  xaa,  xap,  xay,  .  .  .  xba,  xbp,  .  . 
are  different  from  one  another.     They  are 

aa,  ba.  ea;  da,  da,  ea;  bo,  da,  go.:., 
aft,  dp,  eft;  bft,  dp,  gft;  .  . 
ay,    dy,    ey;      by,   dy,   gy;  .  . 


All  of  these 


r3) 


aft,  bft,  eft 
ay,    by,  cy 


Again,  we  write  every   index  of   the  system    Tx)  before  every 

index  of  7\),  and  obtain 

n2(w2—  1) 


n. 


6 


triads  among  the  same  n,»2  elements  with  double  indices.      These 
are  also  different  from  one  another  and  from  those  of  T'z)     They  are 


T",.) 


aa,  aft,  ay;     aa,  a,8,  as;     aa,  a~,  ar,;  .  .  . 
ba,    f> ft .    by:      bo.,    bS,    />•;;      ba,    b",    by,  .  .  . 


ca,  eft,    cy. 


ea,  c<),    cs; 


co.,    C, 


Cr, 


7>  ■ 


•  Finally  we  combine  every  triad  of  Tt)  with  every  triad  of  T.)  by 
writing  after  the  three  indices  of  a  triad  of  Tt)  the  three  indices  of 
a  triad  of  TV).  With  any  two  given  triads  this  can  be  done  in  six 
ways.     For  example  from  b,  d,  g  and  a ,  C,  ij  we  have 

ba,  dZ,  grt  ;      bo.  dvt,  g^;      b-,  do,  gjj,       b~,  dil%  go.:      b  rt .  da,  g£\ 

brt,  dr.  ga. 


232  THEORY    OF    SUBSTITUTIONS. 

We  obtain  therefore  from  T,)  and  T.,) 

ftw,(n, —  1)  ^(^ — 1)  _  h,h2 —  ?i,  —  Ho  +  1 

0--Q-  -g-  --Win,  g      -      > 

such  combinations.     These  are  again  all  different  from  one  another 
and  from  those  of  2",)  and  T"3).     They  are  the  following: 


r",) 


aa,  bft,  cy\  aa,  by,  eft 
a  a ,  b  8 ,  ce;  a«,  b  s ,  c« 
a«,  d/9,  e^;     aa,  dy,  e/5 


aft,  ba,  cy;  .  .  .  ay,  bft,  ca\ 
ad,  ba,  c £ ;  .  .  .  a e ,  bS,  ea; 
a/3,  da,  ey;  .  .  .  ay-,  dft,  ea; 


We  have  therefore  now  constructed  in  all 

Hj(h,  —  1)  n2(n2  —  1).  h,h, —  h, —  Uo  +  1  _  /i|H2(n,Ho  —  1) 

H, 5  f-  >ij  ~~~       ~T~  W1W2  p  —  rt — 

different  triads  among  the  elements 

•£«a  5  '"a/3  >  ** oy  5   •   •   •  J        "X-ba.  j  Xbp  j  "Cfcy  •  •   •  5    •   •   • 

The  three  tables  T8)  therefore  form  a  possible  triad  system  for  //,//_. 
elements. 

§  202.  The  triad  group  for  n  =  3  demands  no  special  notice.  It 
is  simply  the  symmetric  group  of  the  three  elements. 

To  determine  the  group  of  the  triad  equation  for  n  =  7  we  pro- 
ceed as  follows,  restricting  ourselves  to  irreducible  equations  of  this 
type. 

With  this  restriction  the  resulting  group  of  7  elements  is  transi- 
tive. Its  order  is  therefore  divisible  by  7,  and  it  consequently  con- 
tains a  circular  substitution  of  the  7th  order,  which  we  may  assume 
to  be  , 

We  determine  now  conversely  the  arrangements  of  the  7  elements  in 
triads,  which  are  not  disturbed  by  the  powers  of  8, .  These  must  bo 
such  that  if  xa,  Xp,  xy  form  a  triad,  the  same  is  true  for  every  xa  -f-  /, 
Xp  -\-  i,  xy  +  i  (i  =  1 ,  2 ,  .  .  .  6).  Again  with  a  proper  choice  of  nota- 
tion we  may  take  xa  =  a?, ,  Xp  =  x., ,  since  a  proper  power  of  8,  will 
contain  the  two  elements  xa,  Xp  in  succession.  If  now  we  apply  the 
powers  of  s,  to  the  system 

*y*       'Y*       /y*  •        /y*       sy*       /y*  *        y*      /y*       *y*  *        /y*       /y*        y*  •      *•        r1        y*    • 


RATIONAL    RELATIONS    BETWEEN    THREE    ROOTS.  233 

it  appears  that  only  the  second  and  the  fourth  cases  give  rise  to  a 
triad  distribution  of  the  required  character,  viz. 

J  i )      .r, ,  .('._, ,  .1  ,;      .('_,,  .r, .  .»■-,;      ,*',,  .r4,  ,rh;      .r4,  .;■-,  Xj]      .r-it  u*6,  CCt ; 

i Li I     .i"],  x3i  -^'u^    3?o,  a*3,  ^ ; ;     x3l  xt,  .<■, ;     .>', ,  .'■- ,  ./•. ;     .f. ,  a;ej  a?3; 

The  two  distributions  are  not  essentially  different,  each  being  ob- 
tained from  the  other  by  interchanging  x,,.r7;  xa ,  x^ :  and  x4 ,  sc5 . 
We  may  therefore  assume  that  Tx )  is  given,  and  that  S,  belongs 
to  the  corresponding  group.  If  there  are  other  substitutions  of  the 
7th  order  belonging  to  the  group,  a  proper  power  of  every  one  of 
these  will  contain  a?,  and  ,»\  in  succession.  We  may  write  the  sub- 
stitution therefore 

l.'V'V.  •''.,•'•,'•,,•'',;)  =  (1  2  a3  o4  a5  a,  a7j 
To  this  substitution  correspond,  as  in  the  case  of  Sj ,  only  two 
triad  systems,  which  proceed  respectively  from  1,  2,  a4  and  1,  2  a6. 
The  indices  <t...  .  .  .  a6  must  be  so  taken  that  the  new  systems  coin- 
cide with  T,  I.  In  this  way  we  obtain  seven  new  substitutions  s. 
For  example,  if  the  seven  triads 

1,  2.  «„:  2,  03,  aT;  <t.,,  a4,  1;  a4,  a,,  2;  a5,  a6,  a3;  ar>,  c^,  a4 ;  a7,  1,  a, 
are  to  coincide  respectively  with 

1,2,4;     2.3.5;      3,7,1;     7.6,2;     I),  4, 3;     4,5,7:     5,1,6, 

we  must  have  'a,  =  3,  a4  =  7,  a.-,  =  6,  Og  =  4,  a7  =  5,  and  accord- 
ingly s  =  ('.(•,.*•..(•  :l.r7.i,,i.r4.r-,).     Similarly  we  obtain  for  the  seven  new  s's 

I    »*     »•     i'     »■     m'     i'    Y*    1        c     I -if  'Y*   /V*  />*    ■>*     f     »»    1        o     I^y*   ^Y*    ~y*     r*    >■  o"    'y.    1 

2  —  V**  1     2     5     4     ;>     7     fi ''        ■«  —  V ^l**  2     li     1'    7'    ;;**  5m       4  —  \     1      '     7      I     6     V    3/J 

•S-  —  ( -J'j.r j.l'i  l  ;.t  h.i  4.f  - ;,    Sg  —  ^Cju".>/*  -.*  ,.<  -jX^X^J^    S7  —  [X \Xi>X '^X^X^X fl '-jf , 

/  'y.      y      y.    /y.    ry*    /v.    />»     \ 

8  —  V*-')      _•'  7''  .!•'  :,•'  4'    G  '• 

Beside  the  powers  of  s, ,  s2 ,  .  .  .  ss  there  can  obviously  be  no  other 
substitutions  of  the  rtth  order  in  the  group.  We  note,  without 
further  proof,  that  it  follows  from  this  by  the  aid  of  §  76,  Theorem 
XII,  that  the  required  group  is 

{  S,  ,  So ,  .  .  .  Ss   j 

The  same  result  has  been  obtained  by  Kronecker  from  an  entirely 
different  point  of  view. 


234 


THEORY    OF    SUJSTITrTIoNS. 


Theorem  V.     The  roots  of  the  most  gem  ral  irreducible  triad 
(■(Illation  of  the  1th  degree  can  be  arranged  as  follows: 

77/r  group  of  the  equation   is  the  Kronecker  group*  of  order   t68r 

defined  l>;j 

:     az  +  b\t     \z     aO(z  +  b)  +  c 

(a      1,2.  t;     b,  c±=0,  L, . .  .  6;     0(«)  =  -    v.    f  1)) 

7<  is  doubly  transitive.      Those  of  its  substitutions   which  replace' 

.<   .  .'•.  by  .<■;.  Xa  are 

I.  r.,./', .'M  I  .'■.'• ,.»-, ).    I. (•„.(•,.(•.,)  ( .<•,./,.*•  |.     l.rM.r,.r.)  ( .c  ,.*'4.c,J.    (.)'„.*•,.*'  )  I  -'",.''-,'"„)■ 

A//  Mc.se  f//.s-o  replace  x3  by  jc0.      Consequent!!/  we  have  also 

x0  =  &1(x1,xs),    .«-,  =  -';,(.*•,..*■„), 
a/(«/  similarly 

••-,      ''V ■'',•,  •<•<).     ■'•■  =  ''',(-«-4.  ■'■,>;  e/r. 
A?/  the  substitutions  of  the  group  which  interchange  .«•„  and  .*•,  are 

<■'•„•<•,)   (■'•..■••    '.         ''-,•'-,)   l-'V'U,  (•''„''il  (-'VVv';);  (■'■„•'■,)   <•  r.,.|-,..-,.r,|. 

a»'/  since  £/iese  aM  feave  .<•.   unchanged,  it  follows  that 

and  the  same  property  holds  for  all  the  other  triads.      Every  sym- 
metric function  of  the  roots  of  a  triad  is  a  1-valued  resolvent. 

§  203.  We  examine  also  the  triad  equations  for  u  =  9.  In  the 
construction  of  the  triads  it  is  easily  recognized  that  there  is  only 
one  possible  system,  if  we  disregard  the  mere  numbering  of  the  ele- 
ments. We  can  therefore  assume  the  system  to  be  that  constructed 
in  §'2()1.    and   designate  the  elements   accordingly   by  two  indices. 

c-ach 

00,10,20;     01,11,21;     02,12,22: 

00,01,02;     10,11,12;     20,21,22: 

00,11,22;     01,12,20;     02,  10,21; 

00,12,21;     01,10,22:     02.11.20: 

A  characteristic  property  of  every  such  triad 


is  the  condition 


i"t-  i>'<i-  p"a" 


RATIONAL  RELATIONS  BETWEEN  THBEE  BOOT8.  235 

B)  V+P'+P"      q  +  Q'+q"      0     (mod.3) 

From  tliis  it  follows  that  every  substitution 

s=   p,q     ap-j-bq  +  a,  a'p  +  b'q  +  a'\ 

transforms  the  triad  system  into  itself.  For  the  indices  p,  q:  p\  </'; 
p",  q"  become  respectively 

"}>  ~f" bq  +  "■.  "'/'  -\~b'q  -{-<*■'; 
ap'  +67'  fa,  a'p'  +  b'q'  -fa'; 
ap"  +  og"  +  a,     ay  +  6V  +  «"; 

and  if  the  condition  B)  is  satisfied  by  P,p',p"',q,q',q",  it  is  also 
satisfied  by  the  new  indices. 

Conversely,  every  substitution  that  leaves  the  triad  system  un- 
changed can  be  written  in  the  form  s  by  a  proper  choice  of  the 
coefficients  a,  0,  a;  a',  //,  a'.  For  if  f1,  is  any  substitution  of  the 
triad  groiq>  which  replaces  the  index  (0,  <M  by  (a,  a'),  then 

Si  =  j  Pi  '/       /'  +  "■  ■  <i  +  «■' 

does  the  same,  and  consequently  I,  =  f,  Sj  .  which  also  belongs  to 
the  group,  leaves  (0.0)  unchanged.  If  now  t2  replaces  (0,1)  by 
( 1 1,  b'  ),  then 

s-z  =   p,  <]     ap  ~r  bq,  a'p  -f  b'q  | , 

where  a  and  (/'  are  arbitrary,  will  leave  (0.  0)  unchanged,  and  will 
replace  (0,  1 )  by  l>.  b' '.  Consequently  t3  =  t.,*.r  '  will  leave  both  (0,  0) 
and  (0,  1  )  unchanged.     Again  if  /:;  replaces  (1,  0)  by  (c,  <•'),  then 

s3=    p,q      cp,  c'p  +  q 

will  leave (0,  0)  and  (0,1)  unchanged,  and  will  replace  (1,  0)  by  ice') 
consequently    ti  —  f..s:.    '.  which  belongs  to  the  group  of   the  triad 
equation,  will  leave  (0,  0),  (0,  1)  and  (1,  0)  unchanged.     A  glance  at 
the  triad  system  shows  that  we  must  have  tt  ==  1,  and  it  follows  accord 
ingly  that 

Consequently  t,  is  actually  of  the  assigned  form.  Remembering 
further  that  we  have  established  in  §  145  the  necessary  and  sufficient 
condition  that  this  form  shall  actually  furnish  a  substitution,  we  have 
the  following 


236  THEORY    OF    SUBSTITUTIONS. 

Theorem  VI.  The  group  G  of  the  irreducible  triad  equa- 
tion of  degree  •'.  consists  of  all  the  substitutions 

S        }>.  ij        i  ip  -|-  bq  -f-  a ,  a p  -\-  b'q  -\-  a'       (mod.  3 ) 
ab'      '('!>  —  0     (mod.  3) 

Tlic  order  of  G  is,  from  £  145 

r  =  38(3a      1 )  {:{-'  —  :i)  =  27  -  10 

The  root*  of  the  equation   are  connected,   in  accordance  with   the 
triad  system,  as  follows: 

—    ''{■'': ''in).     -''21  —-  '''•''oil   ■'ll'"     •'.'.'  =   ''(-''hj-   -''i.');   •    •   • 

All  the  substitutions  of  G  which  replace  .<•„„  and  .»•,„  by  xVland  ./•,„ 
are  of  the  form 

s'=      P>  2       p-\~bq-\-l,b'q      (mod.  3), 
and  since  these  all  concert  .<•_,,,  into  .*■„,,,   it  follows  that  ice  Juice  also 

•''mi ''(-''lIM    •''•.>(|)j      ^10  =    ''(-''.IK    - ' 'lM.  )  -    ■    •    • 

All  the  substitutions  of  the  group  which  interchange  xM  and  .rw  are 
of  the  form 

s"  =  p,q        2p  +  bq  +  l,b'q       (mod.  3), 
and  since  these  all  leace  .r^  unchanged,  ice  have,  again, 

•'\,"  ''/(.r1MI,  •'•„,)  =  >'H-cw,  •'',...);    •  •  • 

§  204.  The  arrangement  in  triads  given  at  the  beginning  of  the 
preceding  Section  possesses  a  peculiarity,  which  we  can  turn  to 
account.  The  triad  system  is  so  distributed  in  four  lines  that  the 
three  triads  of  every  line  contain  all  the  (.)  elements. 

Evidently  every  substitution  of  the  group  permutes  the  several 
lines  as  entities  among  themselves.  We  determine  now  those  sub- 
stitutions which  convert  every  line  into  itself.     If 

a  =    />,  1 1        a j>  -)-  bq  -f  a .  a'j>  +  b'q  -\-  «'       ( mod.  3) 

is  to  convert  the  first  line  into  itself,  the  new  value  of  7  must  depend 
solely  on  the  old  value  of  q,  but  not  on  the  value  of  p.  Consequently 
we  must  have  a'  =  0.  If  the  substitution  is  to  convert  the  second 
line  also  into  itself,  we  must  again  for  the  same  reason  have  t>  =  0. 
The  substitution  is  therefore  of  the  form 

<-       />.</       ap-f-a,  b'q-\-a'      mod.  3). 


RATIONAL    RELATIONS    BETWEEN    THREE    BOOTS.  -'■)  t 

That  conversely  a)l  these  substitutions  satisfy  these  two  conditions 
is  obvious.     Their  number  is  32>22,  since  ab'  -     0  (mod.  3). 

It  is  further  required  that  a  shall  also  leave  the  third  and  fourth 
lines  unchanged.  The  third  line  has  the  property  thatfin  every  triad 
(P(h  Pf<l'iP"ll")  the  three  sums 

+'      I  '  '  t      I  ft 

<h  V  +<1 >  P    +  '/ 

have  respectively  the  values  0,  1,  2  (mod.  3);  the  fourth  that 

p  +  q=  p' -f  q  =p"  +  q"     (mod.  3). 

If  now  we  apply  a  to  the  triad  (00,  12,  21)  of  the  fourth  line,  we 

obtain 

(a, a';     a  +  «,  26'+ a';     2a  +  «,  6'+ a')      (mod.  3), 

and  consequently  we  must  have 

u  +  a!  =a+  2b'  +  «  +  «'  :    2a  +  b'+  a  +  a'     (mod.  3), 

that  is, 

a      b'     (mod.  3). 

The  tinal  form  of  <t  is  therefore 

a—   p,q     ap-\-u,  aq  +  u  | . 

Conversely  all  the  substitutions  of  this  type  convert  every  one  of 
the  four  lines  into  itself.  The  substitutions  form  a  subgroup  H  of 
G  of  order  2  32,  since  a  can  only  take  the  values  1  and  2.  H  is  a 
self-conjugate  subgroup  of  G.  For  if  r  is  any  substitution  of  G, 
then  r    '  H  -  leaves  every  line  unchanged,  i.  e.,   ?    '  Ht  =  H. 

The  group  II  of  order  2  •  3'"',  being  a  self-conjugate  subgroup  of 
G  which  is  of  order  2'  •  33,  we  can  construct,  by  4;  86,  the  quotient 
T=  G:H  of  order  23  •  4  =  24  and  of  degree  4  (corresponding  to 
the  four  lines  of  triads).  This  group  is  of  course  the  symmetric 
group  of  4  elements. 

If  therefore  we  construct  a  function  c  of  the  9  elements  x, 
which  belongs  to  the  group  II,  this  four-valued  function  is  the 
root  of  a  general  equation  of  the  fourth  degree,  the  group  of  which 
is   T. 

If  this  equation  of  the  fourth  degree  has  been  solved,  the  group 
of  the  triad  equation  reduces  to  H,  of  order  2  •  3Z,  as  is  readily 
apparent.  The  systematic  discussion  of  this  class  of  questions  is 
however  reserved  for  Chapter  XIV. 


238  THEORY    OF    SUBSTITUTIONS. 

§205.      We  consider  farther  the  subgroup  of   //   which  leaves 

everv  single  triad  of  the  first  line  of   our  table   unchanged.     In 

order  that 

/'•'/     ap  +  a,  aq   -  a' 

may  have  this  property,   the  values    (7  =  0,  L,  2,  must   give  again 
</ =  0.  1,2.     Consequently  a      <>,  a  —  1.  ami  we  must  take 

"=  P?  Q  P  +  ">  7  ■ 
The  r's  form  again  a  self-conjugate  subgroup  of  I  of  II  oi  ordei  '■>. 
We  construct  by  §86  the  quotient  U  =  H:I.  V  is  of  order  3-2 
and  of  degree  3,  corresponding  to  the  three  triads.  U  is  therefore 
the  symmetric  group  of  three  elements.  If.  then,  we  construct  a 
function  O  of  the  9  elements  x,  which  belongs  to  the  group  /.  this 
latter  adjunction  of  <p)  three-valued  function  depends  on  a  general 
equation  of  the  third  degree. 

If  the  latter  has  been  solved,  the  group  of  the  triad  equation 
reduces  to  /.     A.<  ■  gly  the  symmetric  fill  ls  of 

are  known,  and  therefore  these  three  values  depend  on  an  equation 
of  the  third  degree,  the  coefficients  of  which  are  rationally  expre 
ible  In  terms  of  <.'• .     This  equation  is.  in  fact,  an  Abeiian  equation, 
since  its  group  only  permutes  the  roots   cyclically.      We  have  then 

TlH'oreni    VII.     The  irreducible  triad  equations  of  degree 
9  can  In  solved  algebraically. 

§206.     In  close  relation  to  the  above  stands  the  following 

Theorem   VIII.     If   three  of  the   roots  of  an   irreducible 
equation  of  the  '■'"   degree  are  connected  by  the  equations 

.,-       »(..-..  x  i      "i.'\.  .e).      or,  -"(.<•.. .,-,)  =  0(a  .  a?,), 
x,--  ■0(x^xl)  =  0(xl,x3), 

In  which  0  is  a  rational  function  of  its  two  elements,  then  the  eqna- 

I'uin  can  In-  solved  algebraically. 

We  consider  the  group  of  the  equation.     It  i^  transitive,  and  it 

see  the  three  roots.  .<-t.  .•■  ,  .•■,   by  three  others  between  which 

the   same    relation   must    exist   as   between    .<■,..-•...<•.    themselves. 
Suppose    the  new    roots    to  be  ■-•',.'•'  •  p'  ■     If    the    two    systems 


RATIONAL    RELATIONS    BETWEEN    THBEE    ROOTS.  '-"'>'•> 

',..-..,.  and  •'■',.  .>■',.  .»■'.,  have  two  roots  in  common,  then  they 
have  also  the  third  root  in  common.  For.  if  .?■,  —  .»•',,  ./  .•  ■'. .  it 
follows  that 

and  if  x\  and  x3  are  not  the  same  root,  the  given  equation,  having 
equal  roots,  would  be  reducible. 

If  xt  is  a  root  different  from  .<■,.  .,■,.  .v..  there  is  a  substitution  in 
the  group  which  replaces  .r,  by  .r4.  If  this  substitution  leaves  no 
element  unchanged,  we  obtain  an  entirely  new  system  ■'•,,■'•-,,'•,,. 
But  if  one  element,  for  example  .v..,  remains  unchanged,  we  have  for 
anew  system  .»•_.,  .<■,,  .c7.  Proceeding  in  this  way,  and  examining  the 
possible  effects  of  the  substitutions,  it  is  seen  that  all  the  roots 
arrange  themselves  in  the  triad  system  of  9  elements.  Comparing 
this  result  with  Theorem  VI,  it  appears  that  the  equation  is 
exactly  one  of  the  triad  equations  just  treated. 

It  is  known  *  that  the  nine  points  of  inflection  of  a  plane  curve 
of  the  third  order  lie  by  threes  on  straight  lines.  These  lines  are 
twelve  in  number,  and  four  of  them  pass  through  every  point  of 
inflection.  Any  two  of  the  nine  points  determine  a  third  one.  so  that 
the  points  form  a  triad  system,  as  considered  above.  The  abscissas 
or  the  ordinates  of  the  nine  points  therefore  satisfy  a  triad  equa- 
tion of  the  9th  degree,  and  this  equation,  belonging  to  the  type 
above  discussed,  is  algebraically  solvable. 

It  can,  in  fact.be  shown  that  if  -<\,  .>-,.  .<■ ,  are  the  abscissas  or 
the  ordinates  of  three  points  of  iuilection  lying  on  the  same 
straight  line,  then 

.r  =0{  »-,.  x2),  xs  =  'H-c,.  .r,),  x2=  "(.<■,  a?,), 

where  0  is  a  rational  and  symmetric  function  of  its  two  elements. 
The  discussion  of  this  matter  belongs  however  to  other  mathemati- 
cal theories  and  must  be  omitted  here. 

*0.  Hesse:  Crelle  XXVIII,  p.  68;  XXXIV,  p.  191.    Salmon:  Crelle  XXXIX.  p.  365. 


CIIAPTKU  XIII 


THE  ALGEBRAIC  SOLUTION  OF  EQUATIONS. 

§  207.  In  the  last  three  Chapters  various  equations  have  been 
treated  for  which  certain  relations  among  the  roots  were  d  priori 
specified,  and  which  in  consequence  admitted  the  application  of  the 
theory  of  substitutions. 

In  general  questions  of  this  character,  however,  a  doubt  presents 
itself  which,  as  we  have  already  pointed  out,  must  be  disposed  of 
first  of  all,  if  the  application  of  the  theory  of  substitutions  to  gen- 
eral algebraic  questions  is  to  be  admissible.  The  theory  of  substi- 
tutions deals  exclusively  with  rational  functions  of  the  roots  of 
equations.  If  therefore  in  the  algebraic  solution  of  algebraic  equa- 
tions irrational  functions  of  the  roots  occur,  we  enter  upon  a  re- 
gion in  which  even  the  idea  of  a  substitution  fails.  The  funda- 
mental question  thus  raised  can  of  course  only  be  settled  by  alge- 
braic means;  the  application  to  it  of  the  theory  of  substitutions 
would  beg  the  question.  To  cite  a  single  special  example,  proof 
of  the  impossibility  of  an  algebraic  solution  of  general  equations 
above  the  fourth  degree  can  never  be  obtained  from  the  theory  of 
substitutions  alone. 

§208.  In  the  discussion  of  algebraic  questions  it  is  essential 
first  of  all  to  define  the  territory  the  quantities  lying  within  which 
are  to  be  regarded  as  rational. 

We  adopt  the  definition*  that  all  rational  functions  with  integral 
coefficients  of  certain  quantities  ))\'.  SM".  St"',  .  .  .  constitute  the 
rational  domain  (9t,  9t"  '.K'".  .  .  . ).  If  among  any  functions  of  this 
domain  the  operations  of  addition,  subtraction,  multiplication,  divis- 
ion, and  involution  to  an  integral  power  are  performed,  the  result- 
ing quantities  still  belong  to  the  same  rational  domain. 

The  extraction  of  roots  on  the  other  hand  will  in  general  lead 

*],.  Kroncckrr:  I5erl.  Ber  187*,  !>■  205  II.:  Cf.  also:  a  r:  t  h  in.  Theorie  d.  algob.  Grossen. 


THE    ALGEBRAIC    SOLUTION    01"    EQUATIONS.  241 

to  quantities  which  He  outside  the  rational  domain.  We  may  limit 
ourselves  to  the  extraction  of  roots  of  prime  order,  since  an  (mn)a> 
root  can  be  replaced  by  an  j;/"1  root  of  an  ulh  root. 

All  those  functions  of  9t',  9t",  9t'",  .  .  .  which  can  be  obtained 
from  the  rational  functions  of  the  domain  by  the  extraction  of  a 
single  root  or  of  any  finite  number  of  roots  are  designated,  collect- 
ively, as  the  algebraic  /mictions  of  the  domain  (91',  31",  9t'",  . . .). 
In  proceeding  from  the  rational  to  the  algebraic  functions  of  the 
domain,  the  tirst  step  therefore  consists  in  extracting  a  root  of  prime 
order  pvol  a  rational,  integral  or  fractional  function  ^,,(91',  9t",  9t'" .  •  .) 
which  in  the  domain  (s.)i\  9t'',  91'",  .  .  .)  is  not  a  peifect  puib  power. 
Suppose  the  quantity  thus  obtained  to  be  Vv  so  that 

F?"  =  *Tv(9r,9r,9T',...). 

We  will  now  extend  the  rational  domain  by  adding  or  adjoining  to 
it  the  quantity  Vv,  so  that  we  have  from  now  on  for  the  rational 
domain  (V„;  9t',  9t",  9ft"',  .  .  .),  i.  e.,  all  rational,  integral  or  fractional 
functions  of  V„,  9i',  91",  W",  .  .  .  are  regarded  as  rational.  The 
present  domain  includes  the  previous  one.  With  this  extension  goes 
a  like  extension  of  the  property  of  reducibility.  Thus  the  function 
xp  — F„CSt',  9i",  .  .  .)  was  originally  irreducible:  it  has  now  become 
reducible  and  has,  in  the  extended  domain  (V„;  W,  9t",  .  .  . ).  the  ra- 
tional factor  x —  l', .. 

The  new  domain  can  be  extended  again  by  the  extraction  of  a 
second  root  of  prime  order.  We  construct  any  rational  function 
which  is  not  a  perfect  (pv_vth  power  within  (TV,  5Jt',  Jft",  .  .  .,  and 
denote  its  (p,._i)lh  root  by  F„_n  so  that 

It  is  not  essential  here  that  Vv  should  occur  in  F\,_x  If  now 
we  adjoin  Vv_x,  we  obtain  the  further  extended  rational  domain 
(F„_,,  Vv\  91',  9t",  .  .  .).     Similarly  we  construct 

Vp»_-2*=Fv_2(Vv_„Vv;W,*t",...), 
FrL78  =  f,_,(1V_tl  VV_X1VV\  91',  91", . . .), 

Vp>  =  F1{V2,Va,...Vv;W,  %",...), 
16 


THEORY    OF     SUBSTITUTIO. 

where  the   P's  denote  rational  function-  of  the  quantities  in  paren 
theses,  and  Pi,jo2,  .  .  ■}>,-:  are  prime  numbers. 

Any  given  algebraic  expression  can  therefore  be  represented  in 
conformity  with  the  preceding  scheme,  by  treatin  ame 

way  in  which  the  calculation  of  such  an  expression  involving  only 
numerical  quantities  is  accomplished. 

£  '200.  Tho  FaS  are  readily  reduced  to  a  form  in  which  they  are 
integral  in  the  corresponding  V"s.  that  is  Va+l,  Va+2 .  .  .  Vv,  and 
are  fractional  only  in  the  9ft',  9ft",  .  .  . 

Thus,  suppose  that 


where  6r0,  Gx,  G2,  .  .  . ;  H„,  H},  H2,  .  .  .  are  rational  in  Va+2,  F0  +  3,... 
I  \:  9ft',  9ft",  .  .  If  now  co  is  a  primitive  d>o+i),h  root  of  unity,  the 
product 


Pa  + 1  - ' 


A  =  0 

is  a  rational  function  of  Va+2,  Va  +  3,  .  .  .  Vv\  sJt\  9t", .  .  .  For  on  the 
one  hand  the  product  is  rational  in  the  H's,  and  on  the  other  it  is 
integral  and  symmetric  in  the  roots  of 

VZtf=F.+x{V*+»  . .  .  Vv;  SR',  9ft",  . . .) 

and  is  therefore  rational  in  the  coefficient  Fa  f]  of  this  equation. 

Again,  if  we  omit  from  the  product  P)  the  factor   HQ-\-  HxVa  +  x 
+  H2  V2a  +  l  +  .  .  .  ,  the  resulting  product 

Pa  +  1  -  ' 

P,)  JJ[H0  +  Hl<o*Va+1  +  Haa>**Vl+2+  . .  .] 


A=> 


is  integral  in  Va  +  i  and  rational  in  Fa+2,  .  .  .  Vv;  9t',  9t",  .  .  .  More- 
over, since  to  does  not  occur  in  P)  or  in  the  omitted  factor,  it  does 
not  occur  in  P,). 

If  now  we  multiply  numerator  and  denominator  of  Fa  by  Pj), 
the  resulting  denominator  is  a  rational  function  of  T^a  +  25  •  •  •  Vv'i 
9t',  9t",  . . .    alone,  while  the  numerator  is  rational  in  these  quan- 


THE  ALGEBTUIC  SOLUTION  OF  EQUATIONS.  243 

tities  and  in  Va+i*  Dividing  the  several  terms  of  the  numerator 
by  the  denominator,  we  have  for  the  reduced  form  of  Fa 

Fa  =  J0  +  JlVa  +  l  +  J,Vl  +  l+  .... 

where  the  coefficients  J0,Jl,J2l  ■  ■  ■  are  all  rational  functions  of 
J\i+2j  •  •  •    Vv't  9ft',  SW,  ...      On  account  of  the  equations 

K\V=Fa+u   vpa%y+l  =  Fa+1va+}, . . . 

we  may  assume  that  the  reduced  form  of  Fa  contains  no  higher 
power  of   Va  +  l  than  the  (pa±\ —  I /u- 

The  several  coefficients  J  can  now  be  reduced  in  the  same  way  as 
Fa  above.  By  multiplying  numerator  and  denominator  of  their 
fractional  forms  by  proper  factors,  all  the  J's  can  be  converted  into 
integral  functions  of  Va+i  of  a  degree  not  exceeding  pa+2  —  1,  and 
with  coefficients  which  are  rational  in  Va+3,  .  .  .  Vv;  9i',  9ft".  ...  In 
this  way  we  can  continue  to  the  end. 

§  2 10.  We  have  now  at  the  outset  to  establish  a  preliminary 
theorem*  which  will  be  of  repeated  application  in  the  investigation  of 
the  algebraic  form  peculiar  to  the  roots  of  solvable  equations.* 

Theorem  I.  If  /„,/,,  .  ..fP-i',F  are  functions  within  a 
definite  rational  domain,  the  simultaneous  existence  of  the  fico  equa- 
tions 

A)  /o+/^+/.«'2+  •  •  •  -i/,-,^-1  =0, 

B)  w*—F  =0, 

requires  either  that  one  of  the  roots  of  B)  belongs  to  the  same  rational 
domain  with  /0,/n  .  .  •  f,,-i',  F,  or  that 

/o  =  0,  fl  =  0,...fp_1  =  0. 

If  all  the  /„./,.  .  .  ./,,_]  are  not  equal  to  0,  the  equations  .1)  and 

B)  have  at  least  one  root  w  in  common.  In  the  greatest  common 
divisor  of  the  polynomials  A)  and  B)  the  coefficient  of  the  highest 
power  of  w  is  unity,  from  the  form  of  B).  Suppose  the  greatest 
common  divisor  to  be 

C)  cr0  4-  (.',?('  -f-  c,V-  -+-....+  ICV. 

Equated  to  0,  this  furnishes  v  roots  of  B).     If  one  of  these  is  deno- 

*Tliis  theorem  .vis  urighiail)  i^iveii  by  And:  Deiivre-*  coui|ji&ieH  II,  luii.  Ivrou- 
euker  was  Hie  Qrst  lo  establish  it  in  the  lull  importance:  Berl.  Her.  1879,  p. 


244  THEORY    OF   SUBSTITUTIONS. 

ted  by  IP,,  and  a  primitive   ptb  ro  t  of  unity  by  w,  then   all  the  - 
roots  of  C)  can  be  expressed  by 

U'l,  ioaU\,  tfPll\,  fttfJC,,  .  .  . 

Apart  from  its  algebraic  sign,  tr0  is  the  product  of  these  roots 

Now  since  p  is  a  prime  number,  it  is  possible  to  find  two  numbers 

u  and  v.  for  which 

pu  +  v  v  =  1 , 
and  consequently 

(±  toY=a>*wl1-'; 

,./&ic]  =  F"(±Yfy. 
One  root,  a,r*«j,,  of  the  equation  i?)  therefore  belongs  to  the  given 
rational  domain. 

§  211.     We  apply  Theorem  I  first  to  the  further  reduction  of 

If  JK  is  anyone  of  the  coefficients  ./../..      .  which  does  i^pt  vanish, 
we  determine  a  new  quantity  Wa+]  by  the  equation 

A,)  Wa+l~JKY0  0, 

annex  to  thi9  the  equation  of  definition  for  V&+  , 

and  fix  for  the  rational  domain 

R)  (T^.+,;F,.+„V.+„... ;»',»",...), 

It  follows  then,  if  A)  and  i?)  of  Theorem  I  are  replaced  by  .1,)  and 

£,),  that,  since  the  possibility  TF.+1  -  0,  J,  =  0  is  excluded,  we  must 

"  hive 

C,)  «r.+1  =  i2(W.+1;  ra     F,; «',»",  ...» 

where  w  is  a  (p„      Ith  root  of  unity. 

We  can  therefore  introduce  into  the  expression  for  /•'„  in  the 
place  of  Va  +  l  the  function  Wa  ,.  provided  we  adjoin  the  (pa  ,)lhroot 
of  unity,  <",  to  the  rational  domain.  From  .1,)  and  U .  i  ii  is  clear  thai 
(W.+,!  F.+t,...!  tt'.ffi",  ...ina-lll'..,.!',  ,  •  . ". ;  *',»",...). 
define  the  same  rational  domain,  and  tho  equation 

B')      w?£l  =  J»«+- F25+l==#.+1<y.       i\   „       r,-K'.ji"     j 


THE    ALGEBRAIC    SOLUTION    OF    EQCATIONa.  245 

can  be  taken  in  the  scheme  of  §  208  in  place  of  £,).  The  equations 
of  definition  for  F„,  Fa_,,  ...  V,  are  not  essentially  affected  by  this 
change.  We  h;ive  only  to  substitute  in  the  func  ions  Fa,  Fa_1, .  .  .Fx 
in  the  place  of  VaJrl  the  value  taken  from  Cx).  The  expression  for 
Fa  then  becomes  simplified 

We  may  suppose  this  reduction  to  have  been  effected  in  the  case  of 
every  Fa. 

§  212.     We  pass  now  to  the  investigation  of  the  form  of  the  roots 
of  algebraically  solvable  equations.     Griven  an  algebraic  equation 

1)  f(x)  =  0 

of  degree  n,  the  requirement  that  this  shall  be  algebraically  solv- 
able can  be  stated  in  the  following  terms: — from  the  ratioLal  domain 
(jR',  •){", ...),  which  includes  at  least  the  coefficients  of  1),  we  are  to 
arrive  at  the  roots  of  1)  by  a  finite  number  of  algebraic  operations. 
riz.  addition,  subtraction,  multiplication,  division,  raising  to  powers, 
and  extraction  of  roots  of  prime  orders.  One  of  the  roots  of  1 ) 
can  therefore  be  exhibited  by  the  following  scheme: 

F^  =  0R\9r,...), 


3)  ar.=_G«+G1T1+  G,TV+  •  •  •  +  GP^VP>-1, 

where  G0,  GiyGs,  . ..  are  integral  functions  of  V2,  V3, . . .  V„  and  ra- 
tional functions  of  9ft',  W,  '.  .  . ,  and  Gx  may  be  assumed  to  be  1(§  211). 
Taking  the  powers  of  x0  and  reducing  in  every  case  those  pow 
ers  of   F,  above  the  (p,  —  l)u',  we  obtain  for  every  v 

If  these  powers  of  x0  are  substituted  in  1),  we  have 

A)  f(x0)  =  H0  +  H1V1  +  H.2V<  +  .  .  .  +JffJ1_lFV\ 

where  the  iTs  are  formed  additivily  from  the  G(,,s  and  the  coeffi- 
cients of  1).     Joining  with  A)  the  equation  of  definition  of   Vx 


240  THEORi     uh     SUBSTITUTIONS. 

and  applying  Theorem  I  to  A)  and  B),  we  have  only  two  possibili- 
:  cither  a  root  of  B)  is  rational  in  the  domain  ( V2,  V3,  . .  .  V  ; 
3t',  »",  .  .  . ),  or 

Ho  =  0,  ff,  =  0,  fff  =  0,  ...#,„_,  =0. 

Both  cases  actually  occur.  In  the  former  the  scheme  2),  by  which 
we  passed  from  the  original  rational  domain  to  the  root  xQ,  can 
be  simplified  by  merely  suppressing  the  equation 

Vfi  =  Fl(V2,V8,...), 

and  adding  the  ^,th  root  of  unity  to  the  rational  domain. 

§  213.     As  an  example  of  this  case  we  may  take  the  equation  of 
the  third  degree 

f(x)  =  x*  —  Sax  —  26  =  0, 

the  rational  domain  being  formed  from  the  coefficients  a  and  6.  By 
Cardan's  formula 


•''..=   N/6  +  ]  +   V  b  —  y  6*  —  a3- 

This  algebraic  expression  can  be  arranged  schematically  as  follows: 

V92  =  b*—a\ 

V,?  =  b+Vz, 
Vl3  =  b—V3. 

--v*+v\. 

The  expression  for  '  j  |  c0),  formed  as  in  the  preceding  Section,  then 
becomes 

y(x0)  ay2+(F2a— <*)7i+VaT7  =  0. 

Comparing  this  with 

F,3— (6—  Va)  =  0, 

and  determining  \\  from  the  hist  two  equations,  we  obtain 

Q 

so  that  Vj  is  already  contained  in  the  rational  domain  (  V2,  V:i;a,  b). 
If  we  now  transform  F,  into  an  integral  function  of   V.2  by  the  pro 
ceio  of  §  20'J.  we  obtain  from  the  relations 


TEE    ALGEEBAIC    SOLUTION    OF    EQUATIONS.  247 

[a2+  (6  +  Va)wVa— tWFj,2]  [a2+  (6  +  T3)W2F2— a^F,2] 

=  2b(b+V,)(a+V.?), 
[a2+(6+  ^)V2-aF22][26(6  +  F8)(a  +  F/)]=[26(6  +  V3)]\ 
[a(6  +  y3)  —  a"  F2  +  (6  —  F8)  TV]  [26(6  +  V3)  (a  +  y22 )] 

=  ±ab\b+V3)Y  . 

where  wisa  primitive  cube  root  of  unity,  the  simpler  form 

_  4»62(6+TV)Tv  _    aV,2 
l~=     462(6+F3)"'      ~b+Vt' 

Removing   V3  from  the  denominator  by  multiplying  both  terms  of 
the  fraction  by  b —  T';,  we  have  finally 

and  herewith  the  reduced  form  of 

Vx  can  therefore  be  suppressed  in  the  scheme  above. 

§  214.     We  return  now  to  the  results  of  §  212  and  examine  the 
second  possible  case.     In 

f(x0)  =  H0  +  HlVl+H2V2  +  •  •  •  +HPl_1V^~1 

suppose  that  Vx  is  not  rational  in  the  domain  (V2,  V„, . . .' ; 9ft',  Ot", . . .). 
Then  from  Theorem  I     - 

#„  =  (),  H,=0,  H2  =  0,...Hin_1=0. 

If  now,  in  analogy  to  3),  we  form  the  expressions 

3')        xk=  G0+  GrfVi  +  ft-»aF«+  .  .  .  G^o^-^V'r', 

(fc  =  0,l,...p,— 1) 

in  which  a>1  is  a  primitive  p,th  root  of  unity,  it  follows,  with  the  same 
notation  and  process  as  in  §  212,  that 

x\  =  G[v)  +  GfVT,  +  g?«*v?  +..., 

f{xk)  =  H0  +  H^ V,  -f  H^V*  +  .  .  . 

Since  the  if 's  vanish  identically,  the  latter  expression  is  also  equal 
to  0,  i.  e.,  xk  is  a  root  of  f(jc)  =  0  for  k  =1,2,...  Pi  —  I. 

For  example,  in  the  case  of  the  equations  of  the  third  degree 


248  THEORY    OF   SUBSTITUTIONS. 

.r3—  Sax  —  26  =  0. 

where  the  first  of  the  two  possibilities  above  has  been  excluded  bj 
reducing  x0  to  the  form 

the  other  two  roots  are 


x*=Vi  +  b—^V,\ 


ex 


xa  =  a?Vt  +     -,-*«>  V, 


(.-=!¥=■) 


b—  V, 
a2 

§  215.  If  now  we  make  the  allowable  assumption  (§  211)  that 
Gl=  1,  (whereupon  F,  may  possibly  take  a  new  form  different  from 
its  original  one),  we  obtain  by  linear  combination  of  the  p,  equa- 
tions for  jr0,  a;, ,  .  .  .  xn  _ , 

x0=G0+Vl  +  G2Vl*+  .  .  .  +  fl^.jTV*-1, 

f. 


xl  =  Qo  +  "V1  +  G,»l*V*+  .  .  .  +  GL_l«*-1TVi-\ 


*«-i  =  G[o  +  ^~,T7i  +  G>2to-1>Fl2+  .  .  .  +  6?M_1o»CPi-»)2vii»,- 


the  value  of  V, : 


i  ■ 

v\  -  i 


r,_>,2 


F,  —  —    >  to.    kXv 


fc=„ 
The  irrational  function   F,  of  the  coefficients  is  therefore  a  rational 
and,  in  fact,  a  linear  function  of  the  roots  x0,xn  .  .  .  cr;i_,  as  soon 
as  the  primitive   p,th  root  of  unity  to,  is  adjoined  to  the  rational 
domain. 

§  210.  In  the  construction  of  the  scheme  2)  it  is  not  intended 
to  assert  that  Fa  necessarily  contains  Va_],  Va-2,  ■  ■  .  If  Va_t  is 
missing  in  Fa,  another  arrangement  of  2)  is  possible;  we  can  replace 
the  order 

VPa%V  =  F«+i(Va+a,...),   V*a*  =  Fa(Va  +  2,...),   V'Xr  =  K{Va,...) 
by  the  order 

vra-  =  Fa+](va+i, . . .),  v*fi  (va+2, . . .),  y;.-'  =  Fa_1(va, . . .). 

It  is  therefore  possible,  for  example,  that  different  Vs  occur  at  the 
end  of  the  series  2).     In  this  case  different  constructions  3)  for  the 


THE  ALGEBRAIC  SOLUTION  OF  EQUATIONS.  248 

root  .i„  are  possible,  and  the  theorem  proved  in  the  preceding  Sec- 
tion holds  for  the  last  V  of  2)  in  every  case. 

To  prove  the  same  theorem  for  all  V's  which  occur,  not  in  the 
last,  but  in  the  next  to  the  last  place  in  2).  we  will  simply  assume 
that  F}  actually  contains  V...     The  proof  (§215)  of  the  theorem  for 
r;  was  based  on  the  fact  that  an  expression 

G»  +  Vy  +  G2V{+  ... 

satisfied  an  equation  with  rational  coefficients.  We  demonstrate  the 
same  property  for  an  expression 

L»+V2  +  L2V.{+  ... 

If  we  suppose  all  the  permutations  of  the  roots  of  the  equation 
1  i  to  be  performed  on 

His— r: 

fc  =  0 

the  product  of  the  resulting  expressions  is  an  integral  function  of 
//,  with  coefficients  which  are  symmetric  in  the  sc's  and  are  therefore 
rational  functions  of  5R',  9i",  .  .  . 

If   we   denote   this  function    by    <p{y),    the    coefficients  of    the 
equation 

Hv)  =  o 

belong  to  the  domain  (W,  3£",  .  .  .),  and  one  of  the  roots,  with  possi- 
bly an  uuessential  modification  of  the  meaning  of   V2  (cf.  §  211)  is 

It  is  therefore  essential  that    V.,  should  actually  occur  in  Fr .      We 
can  now  apply  to  c(y)  =  0  with  the  root  y0  the  same  process  which 
we  applied  above  to  f(x)  =  0  with  the  root  x0.     If  we  assume,  as  is 
allowable,  that  the  series  Vv,  Vv_1,  . . .  V3,  \'2  is  so  chosen  that    l' 
is  not  rational  in  the  preceding  F's,  it  follows  that 

PS 


F!=^2"'!~"i"' 


Pi 


where  <"2  is  a  primitive  p.,th  root  of  unity.      Every  y,,  is  produced 
16a 


250  THEORY    OF     SUBSTITUTIONS. 

from  //„  by  certain  substitutions  among  the  .>;,.  .r, c„    ,;  conse 

quently  V,  is  a  rational  integral  function  of  the  p,th  degree  of  the 
roots  of  /(.r)  —  0,  provided  the  quantities  w,  and  <»,  are  adjoined 
to  the  rational  domain. 

In  the  same  way  every  V  can  be  treated  which  occurs  in  the  next 
to  the  last  but  not  in  the  last  place  in  2).  Proceeding  upward  in 
the  series  we  have  finally. 

Theorem  IT.     The  explicit  algebraic  function  x0,  which  sat 

isjies  a  solvable  equation  f(x)  =  0,  can  be  expressed  as  a  rational 
integral  /miction  of  quantities 

vltva,vt,...  vv, 

urith^  coefficients  which  are  rational  functions  of  the  quantifies 
ft',  ft".  The  quantities  V\  are  on  the  one  hand  rational  integral 
functions  of  the  roots  of  the  equation  f(x)  =  0  and  of  primiti  -e 
roots  of  unity,  and  on  the  other  hand  they  are  determined  by  a 
series  of  equations 

Va^  =  F(Va_1,  Va_2,  ...Vv-  W,  ft",  .  .  . ). 

In  these  equations  the  px,p2,p3,  .  . .  }>„    arc  prime   numbers,    and 
Fx ,  F., ,  .  .  .  Fv  are  rational  integral  functions  of  their  elements   V 
and  rational  junctions  of  the  quantities  ft',  ft",  .  .  .,  ichich  detenu 
ine  the  rational  domain. 

§  217.  This  theorem  ensures  the  possibility  of  the  application 
of  the  theory  of  substitutions  to  investigation  of  the  solution  of 
equations.  It  furnishes  further  the  proof  of  the  fundamental  prop- 
osition : 

Theorem  III.     The  general  equations  of  degree  higher  than 

the  fourth  are  not  algebraically  solvable. 

For  if  the  n  quantities  .»•, .  .,-. r„.  which  in  the  case  of  the 

general  equation  are  independent  of  one  another,  could  be  algebra- 
ically expressed  in  terms  of  ft',  ft",  .  .  .  ,  then  the  first  introduced 
irrational  function  of  the  coefficients,  Vv.  would  be  the  pvth  root  of 
a  rational  function  of  ft',  ft",  .  .  .  Since,  from  Theorem  II,  Vv  is  a 
rational  function  of  the  roots.it  appears  that  \\  .  as  a  /'..valued  func- 
tion of  .<•,.  .<\ .  .  '„,  the  pvth  power  of  which  is  symmetric,  is  either 
the  square  root  of  the  discriminant,  or  differs  from  the  latter  only  by 


THE    ALGEBRAIC    SOLUTION    OF    EQUATIONS.  251 

a  symmetric  factor.  Consequently  we  must  have  pv  =  2  (§  56). 
If  we  adjoin  the  function  V,,  =  .S,  \f  J  to  the  rational  domain,  the 
latter  then  includes  all  the  one-valued  and  two-valued  functions  of 
the  roots.  If  we  are  to  proceed  further  with  the  solution,  as  is  nec- 
essary if  n  >  2,  there  must  be  a  rational  function  F„_,  of  the  roots, 
which  is  (2pv  ,)  valued,  and  of  which  the(p„_i)th  power  is  two-val- 
ued. But  such  a  function  does  not  exist  if  u  >  4  (§  58).  Conse- 
quently the  process,  which  should  have  led  to  the  roots,  cannot  be 
continued  further.  The  general  equation  of  a  degree  above  the 
fourth  therefore  cannot  be  algebraicallv  solved. 

§  218.     We  return  now  to  the  form  of  the  roots  of  solvable  alge- 
braic equations 

3)  x0  =  6?0+  Vy  +  a,T7+  •  •  •  +  GPl_,V^-\ 

We  adjoin  to  the  rational  domain  the  primitive  pxn\  p2th,  .  .  .  roots  of 
unity,  and  assume  that  the  scheme  which  leads  to  x0  is  reduced  as 
far  as  possible,  so  that  for  instance  Va  is  not  already  contained  in 
the  rational  domain  (Va_1  .  .  .  Vv\  9t',  9t",  .  .  . ;  <"n  <»2,  .  .  ♦).  We 
have  seen  that  the  substitution  of 

wfVy  (k=lt2,...Pl-l) 

for  V  in  3)  produces  again  a  root  of  f(x)  =  0.  We  proceed  to  prove 
the  generalized  theorem: 

Theorem   IV.    If  injhe  scheme  2),  which  leads  to  the  expres- 
sion 3)  for  ,'■„,  any  Va  is  multiplied  by  any  root  of  unity,  the  values 

Va-i,  V<x->,  •  ■  ■  V2,  Vi  trill  in  general  be  converted  into  new  quan- 
tifies ra.  ra ._,.  .  .  .  r.,,i\.  If  the  latter  are  substituted  in  the  place 
of  the  former  in  the  expression  for  x0,  the  result  is  again  a  root 
of  f{x)  =  0. 

We  may,  without  loss  of  generality,  assume  that  /(.<•)  is  irredu- 
cible in  the  domain  QR',  St",  .  .  .  ). 

Starting  now  from  3),   and  denoting  by  <"T  a  primitive  r,h  root 
of  unity,  we  construct 
i'\  —  i  /i  - 1 

JJ(x—xky=TJ[x—{G0  +  a,*V1+G2<o1^V*+.  .  .  )\. 

\=U  A— 0 

In  this  product  T,  certainly  vanishes.     Possibly  other  I  "s  vanish 


252  THEORY    OF    SUBSTITUTIONS. 

also.  Suppose  that  r„(a:>2)  is  the  lowest  V  that  actually  occurs. 
Then 

1>    JJ(x—Xi)=fa(x;  l'„,  Va+1,...)  =  a0+a1Va  +  aiVa*+  ... 

The  «'s  which  occur  here  belong  to  the  domain  (  Va  .,,...).  We 
construct  further 

:"  /^/:,(.<v^^,K+I..v)=^-;n,F,,+n..v)=^+,J1T^+^Tr:+.... 

A  =  0 

where  Vh  (ft^a+l)  is  again  the  lowest  V  that  actually  occurs. 
Similarly  let 

6)  JjMx'Mvt,  vb+1,...)=fc(x;  v.,  ve+l...)=ni-nVc+nV?+..., 

A  =  0 

and  finally,  supposing  the  series  to  end  at  this  point. 

/■■■  —  i 

7)  JJfU,  V„  Vc+1,  .  .  !)=/,(*;  »;,  91",  .  .  . ). 

\  =  o 
where  /d  is  rational  in  $R',  9ft",  ....  all  the  Vc+1,  .  .  ,V„  disappearing 
with  r . 

We  assume  now,  reserving  the  proof  for  the  moment,  that  the 
functions 

f„{x;  Va,  .  .  .),  fb{x;  Vb,  .  .  .),  fc(x;  V,.,  .  .  .),  /,(•»"  W,  .  .  .) 

are  irreducible  in  the  domains 

(va,v.+l . . .),  (r„rM  ,...),  (v.,  vc+lt . . .),  («',»"...), 

respectively.  Then  /d(#;  W,  .  . .)  =  0  and/(.r)  =  0  have  in  the  do- 
main (i)i',  S.K",  .  .  .)  one  root  x  =  x0  in  common,  since  .r  —  x0  occurs 
as  a  common  factor  of  fd(x)  and  fix).  Both  these  functions  being 
by  assumption  irreducible,  it  follows  that 

fj&  9T,  *",...  )=f{xj. 

If  now  we  assign  to  V„  any  arbitrary  value  vv  consistent  with 
V'yV  =  Fv(  v.){', .  .  .  )  and  to  Vv_l  any  value  vv.  ,  consistent  with 
r',.'"1  =i<'v_1(vKj  i)C.  .  .  .  ),  and  continue  in  this  way,  we  have  the, 

series 

0 


2') 


THE    ALGEBRAIC    SOLUTION    OK    EQUATION8. 

v?  =  Fj(F,  91",...), 


253 


r 


l'v-  i  _ 

V—  1 


=w^_t(tv; «',«",...), 


'  ,        j      —  J-    v       i\Vv       1  .  '  r.    -'I    .   ./I       .    .   .  J, 


3')  f  o  =  <y„  +  ft  r,+  flr,,r,'J  +  .  .  .  +  f/,,,     ,^i     '. 

3')  being  obtained   from   3)    by  putting  the  r's  in   place  of  the  Vs. 
The  product 


n     i 


fj\-r       (9o+<v}  -\-gaa>l'kVli+  .  .  .)] 


A  =  o 


will  only  differ  from  those  obtained  above  by  the  introduction  of  the 
gr's  and  y'a  in  place  of  the  G"s  and  Vs.  since  in  all  the  reductions  2' ) 
replaces  2).  Consequently  this  product  is  equal  to/„(,r;  v„,  r„  +  M.  .  .  ) 
and  similarly 


»„  - 1 


///■(»;   '"./''«<  t'B  +  n  .  .  .)=/,,(.<':   r,,.  r„    ,....), 


A=0 
-/'ft— 1 


///•(*; 


5      "V   ''/,  5     ''/,-.-   |i    •••    )    /.*•'"•       '',  1  VC+1)    •    ■    •  )) 


A  =  u 
l>, —  1 


JJfc(x,   o^r.r,-    „...)  =  /«(«;    »',  »",..- )=/(*)■ 


A  =  0 


111 


This  furnishes  the  proof  that  !„  is  a  root  of  /(as)  =  0. 

We  have   still  to  prove  the  irreducibility  of  /„(•<•>,  //,(•«),  . 
the  rational  domains  (V„,  Va+1,  ...),(  T,..  Vh  .,....)...,  respect- 
ively. 

Assuming  the  irreducibility  of  /„(as)  in  the  domain  (  I ','.  V„  .,,...). 
we  proceed  to  demonstrate  that  of  /,,(.<)  in  the  domain  (  Vb,  V,, ,  , , . . .). 
The  method  employed  applies  in  general. 

If    cr(,r;  Vb,  .  .  .)   is  one  of  the   irreducible   factors  of  fi(.r),  so 

chosen  that  it  contains  /„(as;  V )  as  a  factor,  then  we  have  in 

the  domain   V„ ,  V„  + , ,  .  .  .  the  equation 

8)  <p(x;Vb,...)=f(x;  Va,  .  .  .)  •  0(as;  V ). 

which  can  be  rewritten  in  the  form 


254  THF.or.Y    OF    BUB8TITUTION8. 

A)  Xo+!xVa+z2Vai+...+Xpa    ,7*    ', 

where  the  /'s  are  rational  functions  of    V„  ......      Since  moreover 

B)  V  ■      /••  (V.    „...)  =  0, 

it  follows  from  Theorem  I  that  either  V„  is  rational   in    F„  _,,..., 

which  is  to  be  excluded,  or  all  the  /'s  vanish,  so  that  A)  and  with  it 

the  equation  8)  above  still  hold,  if  V„  is  replaced  by  toa  V„ ,  <■>.;'  I ' 

Again.  /„(.<•;  w«  V )  is  different  from  fj.r;  u>%V„,  .  .  .).     For  if  we 

write 

fa(x\   ]'„....)  —  e0  +  e,  V„  -f  ^  IV  + 

it  would  follow  from  the  equality  of  the  two  functions  /„  that 

A,)  Bl(o>.*-  <)  Fa  +  £2K2-— ^)y02+  ...=(), 

and  consequently,  from  the  equation  of  definition 

B,)  F*— FJLVm+l,...)  =  Q, 

that  Ta  must  be  rational  in  the  domain  (V„  ,  , ,  .  .  .  31',  .  .  .  »,,  .  .  .), 

since  a=j=/3. 

Accordingly /„(.<';  F„,  . . .),  /„(.*•;  w„F„,  ...),..  .  are  all  divisors  of 
(f.  All  these  functions  are  different  from  one  another,  and  they  are 
all  irreducible  in  the  domain  (V„,  Va+},  .  .  . ).  Consequently  y  con- 
tains their  product,  which,  on  account  of  the  degrees  of  /„  and  fb  in 
./•.  is  possible  only  if  c  and/,,  coincide. 

Since  the  foregoing  proof  holds  for  every  irreducible  factor  of 
1  ).  it  still  holds  if  we  drop  the  assumption  of   irreducibility. 

$  219.  At  the  beginning  of  the  preceding  Section  we  remarked 
that  in  the  product  construction  with  Vx  other  I  's  might  vanish. 
This  possibility  is  however  excluded  in  the  case  of  certain  l'"s.  as 
we  shall  now  show. 

We  designate  any  \\  of  2)  as  an  external  radical  when  the  fol- 
lowing Vt^Y  rT  im  •  ■  ■  '•  ''■<  l'\  ii  l'\  •  do  not  contain  \\. 
Every  such  external  radical  can  be  brought  to  the  last,  position  of 
2),  and  the  expression  of  .<■■„,  as  given  in  3),  can  be  arranged  in 
terms  of  every  external  radical  present.  We  shall  see  that  in  the 
product  construction  with  \\  no  other  external  radical  can  be 
missing.     Thus,  if    l'r  is  missing  in 

pi  - 1 

/.,<■<■:  i'.., . .  .)  =  JJ[x  —  (g0  +  «>ikVi  +  o>vAiv+  •■•)!, 

\-0 


THE  ALGEBRAIC  SOLUTION  OF  EQUATIONS.  255 

then  /„  cannot  be  changed  if  we  replace  l'r  in  the  fundamental 
radical  expression  by  <»TKVT,  without  thereby  changing  l',.  If,  as 
a  result,  the  G'a  are  converted  into  the  y's.  we  should  then  have  also 

./;,(.<•:  r,,...i  =  //l.^fe+»,AF,  +  !/;^r-...)|. 

Every  linear  factor  in  x  of  this  last  expression  must  therefore  be 
equal  to  some  factor  of  the  preceding  expression 

A)  g0+V1+g2V*  +  ...=  Qo  +  ^Vj  +  0,  «,*!?+  .  .  . 
Taking  into  account  the  equation  of  definition 

B)  V»i-F1(V.2,...)  =  Q, 

it  follows  from  Theorem  I  that  either  V}  is  rational  in  V.2,V:],  .  .  .  u>T, 
which  may  be  excluded,  since  otherwise  2)  could  be  reduced  fur- 
ther on  the  adjunction  of  wT,  or  that 

9o  —  Go,  9-2  =  G-2,  ■  ■  ■ 
In  some  one  of  these  equations   VT  must  actually  occur.     Develop- 
ing this  equation  according  to  powers  of   VT,  we  have 

A,)    K0  +  K1VT  +  KiVT2+  . .  .  =Kll  +  K,ojrVr  +  K2cor'iVT2+  .... 

and  combining  with  this 

Bt)  V*r—FT(VT+1,...)  =  0, 

the  impossibility  of  both  alternatives  of  Theorem  I  appears  at  once. 
Consequently  VT  could  not  have  been  missing  in  the  product  con- 
struction. 

If  we  consider  only  /„  (§  218,  4) ),  the  series  2)  ending  with  V„ 
can  also  contain  external  radicals,  in  fact  possibly  such  as  are  not 
external  in  respect  to  the  entire  series.  These  also  cannot  vanish 
in  the  further  product  construction.  The  irreducibility  of  /„  being 
borne  in  mind,  the  proof  is  exactly  the  same  as  the  preceding. 

Theorem  V.  In  the  product  construction  of  the  preceding 
Section  no  external  radicals  can  disappear  from  f„  except  T',.  The 
same  is  true  for  f,,  in  respect  to  the  external  radicals  occurring 
among  VV,VV+1,  .  .  .  V„,  and  so  on. 

If  several  external  radicals  occur  in  x0  or  in  one  of  the  ex- 
pressions fa,  //,,/<-,..,  the  product  of  all  the  corresponding  expo- 
nents is  a  factor  of  n. 


25* ')  THEORY    OF    SUBSTITUTIONS. 

Theorem  VI.  If  an  irreducible  equation  of  prime  degree 
it  is  algebraically  solvable,  the  solution  will  contain  only  one  exter- 
nal radical.  The  index  of  the  latter  is  equal  to  p,  and  if  w  is  a 
primitive  pth  root  of  unity^  the  polynomial  of  the  equation  is 

r       1  • 

f(x)  = //|<      {G0+u>KV1  +  G?a>2KVii+...+Gp    ,«<*    "HY    ')]. 

A  =  0 

Theorem   VI T.     If  the  algebraic  expression 

3)  x0  =  G0  +  T,  +  G,  V{  +...  GJn  _x  V*  -1 

is  a  root  of  an  equation  f(x)  =  0,  which  is  irreducible  in  the 
domain  (9T,  9t",  .  .  . ),  and  if  we  construct  the  product  of  the  p, 
factors,  in  which   \\  is  replaced  by  <",  1',.  "'f'F,  .  .  . 


/„(.»■:  lr„,  .  .  .)=JJ(x-    ■    i. 


where  \'  is  the  lowest  V  present,  and  again  the  product  fb(x;  V,,,...) 
of  the  ji„  factors  /„(.r;  w„AF„,  .  .  .  ),  and  so  on,  we  come  finally  to 
the  etjuation  f(x)  —  0.  the  degree  of  which  is 

n  —ViPaPh  ■  ■  • 
The  functions  f, ,f ,,,...  are  irreducible  in  the  domains  ( V„ ,  V„  + , , . . .), 

{vb,  rh+1, ...),. .. 

§  220.  We  examine  now  further  those  radicals  which  vanish  in 
the  first  product  construction.  The  remaining  V„ ,  V„ .;.,,...  are 
not  altered  in  the  product  construction.  We  may  therefore  add 
these  to  the  rational  domain,  or,  in  other  words,  we  may  consider  an 
irreducible  equation  f(x)=fj->:  V  .  .  .  .  )  in  the  rational  domain 
(Va,V      ;&',&",  ..... 

Here  all  the  Vu  V,,  ...  V„  . ,  already  vanish  in  the  first  product 
construction. 

We  examine  now  what  is  the  result  of  assigning  to  V„_,  any 
arbitrary  value  consistent  with  its  equation  of  definition,  then  with 
this  basis  assigning  any  arbitrary  value  of  V„  .,  consistent  with  its 
equation  of  definition,  and  so  on.     Suppose  that  the  functions 

I  ..     i  >  ^a-2J  •  •  •  V'li  ^i>  G0,  G2,  •  •  •  Gp^i 
are  thereupon  converted  into 


THE    ALGEBRAIC    SOLUTION    OF    EQUATIONS.  257 

Va — i »  vo— a »  •  •  •  vi  t  vi  5  0o  5  Qi  i  ■  •  ■  9p — i  • 
The  new  value  assumed  by  x0  is  then 

Co  =  0o  +  fir^'i  +  SW2  +  9W3  +  •  •  •  +  9P  -  i*'ip  ~  '■ 
From  §  218  ?„  is  again  a  root,  and  this  together  with  the  system 
?n  l2.  . ..  fp_i,  which  arises  from  c0  when  u,  is  replaced  by  a>vx, 
o>2f],  .  .  .  <op~ivu  gives  again  the  complex  of  all  the  roots.     We  can 
therefore  take 


» 


0„+i'i     +ft«i"    +...  =6?„+  o»'Fx+    Qtm*V?  + 

*+■»"*+ ft -V+  . .  •  =  o.+«»"'  F1  +  6?ao»'"aF12+  . . . , 

where  «/,  to",  «/" ,  .  .  .  are  the  pth  roots  of  unity  a»,  w2,  w8,  .  .  . ,  apart 
from  their  order.     By  addition  of  these  equations  we  obtain 

9o=  G0, 
so  that  G0  is  unaffected  by  the  modifications  of   V„_1,  Va_2,  .  .  .  F>. 
Also  p  G0  is  the  sum  of  all  the  roots,  and  is  therefore  a  rational 
function  in  the  domain  (9t',  9i",  .  .  .). 

Again  we  obtain  from  the  system  above  the  equation 

pVl=G0(l+  oi-1+»-»+  .  .  .)  +  F(V  +  a>»v-x+  u>'"a>-*+  .  .  .) 

+  ... 

Here  the  first  term  on  the  right  vanishes.     We  denote  the  paren- 
theses in  the  following  terms  briefly  by  p&uP&a  p-a,  •  ■  • ,  and  write 

9)  4  =  A,  F,  +  Q,G2  V*  +  9.ZGZ F,3  +  .  .  . 

On  raising  this  to  the  pth  power 

A)  vf  =  Ffa,tk,  . . .  jBU-ii  W,  •  •  .)  =  [flJ7i  +  *WW+  •  •  •]* 

=  A0  +  A1V1  +  AaV2a+..., 

and  annexing  the  equation  of  definition 

B)  Vf  =  ^(F,,  F3,  .  .  .  F„_,;  3t',  .  .  . ), 

it  follows  from  Theorem  I  that  either   Vx  is  rational  in 

F2,F3,...  F0_,;  u2,v3,...u0-i;  8f, »",..., 
or  that 

F^  =  ^0,     A,  =  0,     ^,  =  0,  ...  J,_,  =  0. 
17 


258  THEORY    OF    SUBSTITUTIONS. 

We  consider  now  the  first  of  these  alternatives.  In  the  rational 
expression  of  Vt  in  terms  of  V2,  Vs, .  .  .  ;  r_,.  /,,  . . . ;  SR'  9t",  ...  all  the 
v2iv3,.  .  ,va_i  cannot  vanish;  otherwise  V.,  should  have  been  sup- 
pressed in  2).  If  then  we  define  V1}  as  in  §§  208  and  212  by  a 
system  of  successive  radicals,  some  VK  will  occur  last  among  the  u's 
and  some  V\  last  among  the  u's.  If  we  substitute  the  expression 
for  F,  in  x0,  we  have 

x>  =  B(Vl,:.  .  Va+»W,.  .  .)  =  A(r2, .  .  .  Va_liVi,  .  .  .  »._,;»',  .  .  .) 

Here  all  the  v's  cannot  vanish,  as  we  have  just  seen.  For  the  same 
reason  all  the  7's  cannot  vanish,  since  we  might  have  started  out 
from  l0.  But  VK  and  i\  are  two  external  radicals,  and  the  product 
of  their  exponents  must  therefore  be  a  factor  of  p  (Theorem  V). 
This  being  impossible,  the  first  alternative  is  excluded. 
Accordingly  we  must  have  in  A) 

TV  =  A0,     A,  =  0,     A2  =  0,  .  v  .  Ap_,  -  0. 

The  question  now  arises  what  the  form  of  9)  must  be  in  order  that 
its  pth  power  may  take  the  form  Vf  =  A0.     The  equation  A)  is 

vf=  A0  +  AlVl  +  AJT?  +  .  .  .  =  [fl,  F,  +  flt^  V,"  +.--Y- 

The  result  just  obtained  shows  that  the  left  member  is  unchanged 
if   Vx  is  replaced  by  a>  Vx ,  to1  Vx2,  .  .  .      Consequently 

[oiu>Vl  +  LLG2orV:+...Y  =  v>; 

[uyvi  +  <J2G2oSv12+  . .  .]"  =  tv, 


and  on  the  extraction  of  the  pth  root  we  have 

But  from  9)  follows  also 

;-V/7,  +  9.2G2  w*V?+  ...=  w"vu 

and  equating  the  two  left  members  and    applying  Theorem  I  as 
usual,  we  have 

oi  =  0,     <>2G2  =  0,...L>K_]GK_1  =  Q,     QK+1GK+1  =  0,..., 
that  is,  9)  reduces  to  the  single  term 
9')  Pi  =  C«G«TV. 


THE    ALGEBRAIC    SOLUTION    OF    EQUATIONS.  259 

Substituting  this  result,  together  with  g0  =  G0  in  the  expression  for 
f0,  we  have 

c0  =  G0  +  £iKGKV1*  +  g2(aKGKVl'<y+gi(QKGKV1*y+  . . . 

On  the  other  hand  the  root  ?0,  which  is  contained  among  o?0,  xit  . . ., 
can  also  be  expressed  in  the  form 

and,  comparing  the  two  right  members,  it  follows  from  Theorem  I 
that  terms  with  equal  or  congruent  exponents  (mod.  p)  are  identical. 
In  particular  we  have 

QKGKV1"=GKio'-V1K, 

and  therefore 

—  K    (0        > 

10)  vl  =  <o'*GKV1K. 

Theorem  VIII.  If,  in  the  explicit  expression  3)  of  the  root 
x0  of  an  irreducible  equation  of  prime  degree p,  the  irrationalities 
V  are  modified  in  any  way  consistent  icith  the  equations  of  defini- 
tion, then  Vf  is  converted  at  the  same  time  into  (G^V^Y'i. 

§  221.  The  relations  arising  from  such  a  transformation  are 
most  readily  discussed  by  the  introduction  of  a  primitive  congru- 
ence root  e  in  the  place  of  the  prime  number  p.     We  write 

Vx  =  \/l^,     GeVJ=  \/B~,     G*  Vf  =  &W2,  ..., 

where  however  every  ea  is  to  be  reduced  to  its  least  not  negative 
remainder  (mod.  p — 1).     Then  the  quantities 

vu     g.2v;\     G^V?,  ...  G^Vf-1 

coincide,  apart  from  their  order,  with  the  quantities 

Wr^,    \/r7,    \/K, . . .  \/r^T2, 

and  we  have 

11)  x0  =  G0+  &W0+  &R\+  .  .  .  +  \/R^72. 

The  changes  in  the  values  of  the  radicals,  considered  above,  which 
replace  Vf  by  (G^Vf)1'  and  consequently  [G.JV]  by  [GaKV1a^p, 
where  «A  <  p  and 

aK=Aa     (mod.  p), 

have  therefore  the  effect  of  replacing  every  Ra  by 


260  THEORY    OF    SUBSTITUTIONS. 

Ba  +  K      (a  =  0,l,...p-2), 
where  x  is  <  p —  1  and  is  defined  by  the  congruence 

eK  =  l     (mod.  p). 
Consequently  the  quantities 

1)  Jl0,     lil,      -fl25    •    .    .   -tij,—2 

are  converted  in  order  into 

■t^-K  1       -t^K  +  1  5        R>K  +  2  »     •    •    •    -**JC  +  p  —  2  5 

and,  if  the  same  operation  is  performed  «  times,  I)  is  replaced  by 

-L*a.Ki  -^a»c-|-l)  -^aK  +  2»   •   •   •  +-^aK  +  ]>  —  2  J 

where  the  indices  are  of  course  to  be  reduced  (mod.  p  —  1). 

If  there  is  another  modification  of  the  radicals,  which  converts 
R0  into  i?M,  this  on  being  repeated  ,'i  times  converts  the  series  I)  into 

*  -R/3M)     -fiW  +  1?     -fiW  +  25   •   •   •  -fiW+2>-2« 

Finally  if  we  apply  the  first  operation  a  times  and  the  second  /S 
times,  I)  becomes 

RaK  +  P/Jii      ■£»aic  +  Pn  +  n      Ran  +  Ptn  +  k—l- 

Here  a  and  /9  can  be  so  chosen  that  ax-^-fS/x  gives  the  greatest 
common  divisor  of  /■  and  //.  Consequently  if  R,,  is  the  i?  of  lowest 
index  which  is  obtainable  from  R„  by  alteration  of  the  radicals,  every 
other  R  obtainable  from  R0  in  this  way  will  have  for  its  index  a 
multiple  of  k,  so  that  the  permutations  of  the  .R's  take  place  only 
within  the  systems 

Ro,  ■#/.->   ^2*  •  •  •  Rn>-i     A,. 

Ri  >    -Ra -f  1  )     i22i  +  ,  ,  .   .  .  R(lZzzJ  _  i)  /,  +  ! 


Here  k  is  a  divisor  of  p  —  1. 

There  are  then  alterations  in  the  meaning  of  the  radicals  which 
produce  the  substitution 

(R„  Rk  li,,, ...)(/?,  /.',.    |  Bj,  .  ,  ...)... 

§  2'22.     The  preceding  developments  enable  us  to  determine  the 
group  of  the  irreducible  solvable  equations  1)  of  prime  degree  p. 
Every  permutation  of  the  .r's  can  only  be  produced  by  the  alter- 


THE  ALGEBRAIC  SOLUTION  OF  EQUATIONS.  261 

ations  in  the  radicals  V11  V2,  .  .  .  Fa_,,  and  consequently  only  such 
permutations  of  the  a*'s  can  occur  in  the  group  as  are  produced  by 
alterations  of  the  F's.  From  the  result  of  the  preceding  Section 
Vj  can  be  converted  into  a>TG ^.F,'  ,  and  the  possible  alterations  in 
F,  do  not  change  this  form.  Substituting  this  in  the  table  of  §  215, 
we  have 

r0=U0+^G>F/"-+..., 

,-]  =  G0  +  ^  +  1Gf,F/+..., 


We    examine  now  whether  any  root  x^  can  remain  unchanged  in 
this  transformation.     In  that  case -we  must  have 

0.+  . .  .+w*Qj.Vt+...  =  G0+  *r+*G/>Vt  + 

and  from  the  method  which  we  have  repeatedly  employed  it  follows, 
as  a  necessary  and  sufficient  condition,  that 

!>e  =  fi  -f-  r     (mod.  p). 

If  efc=l  (mod.  p),  then  for  r==0  there  is  no  solution  //.,  and 
therefore  no  root  or^  which  remains  unchanged.  But  for  r  =  0, 
every  <l  satisfies  the  condition,  and  the  substitution  reduces  to  iden- 
tity. 

If  ek  ==  1  ,  then  for  every  r  there  is  a  single  solution  ,». ,  and  the 
corresponding  substitution  leaves  only  one  element  unchanged. 

Theorem  IX.  The  group  of  a  solvable  irreducible  equation 
of  prime  degree  is  the  metaeyclical  group  (§  134)  or  one  of  its  sub- 
groups. 

§  223.  Since  now,  as  we  saw  in  §  221,  all  the  substitutions  of  the 
group  permute  the  values R0 , Ek. , R,k. ,.. .  only  among  themselves,  the 

symmetric  functions  of  these  values  are  known,  and  the  values  them- 

p 1 

selves  are  the  roots  of  an  equation  of  degree  - — - —  .     The  latter  is  an 

K 

Abelian  equation  since  the  group  permutes  the  values  i?0,  Rk,R2k.,  .  .  . 
only  cyclically.     Consequently  every  Kk,  jR2fc,  Ru.,  ...    is  a  rationa 
function  of  R0.     But  the  same  is  true  of  every  Ra.     For  the  form 
of  the  substitution  at  the  end  of  §  221  shows  that  after  the  adjunc- 


202  THEORY    OF    SUBSTITUTIONS. 

tion  of  R0  all  the  other  -R0's  are  known,  since  the  group  reduces 
to  1. 

Finally  it  appears  that  if 

Ra  =  ^'a(-Ro) 

then 

Ra  +  l-m  -—  J-1  a\Rkm)- 

For  the  application  of  properly  chosen  substitutions  of  the  group 
converts  the  first  equation  into  the  second. 

We  consider  now  all  the  substitutions  of  the  group  of  f(x)  —  0 
which  leave  R0  =  Vf  unchanged  and  accordingly  can  only  convert 
Vj  into  some  w"Vl.  Then  jc0  is  replaced  by  xv.  But  since  R\  is  a 
rational  function  of  E0,  it  appears*  that  Rx  —  GfV"1'  is  also  unchanged, 
so  that  GeVi  is  converted  into  some  GgW^V^.  The  power  W1  can 
be  determined  from  xv\  for  the  expression  for  xv  contains  the  term 
GeV{,»v%  and  this  must  be  identical  with  G^Vf.  Consequently 
fi=zve,  and  GeV{  becomes 

while  at  the  same  time   V'  becomes 

so  that  the  factor  Ge  remains  unchanged.  That  is,  every  substitu- 
tion of  the  group,  which  leaves  R0  unchanged,  leaves  Ge  unchanged 
also.  Accordingly  Ge  is  a  rational  function  of  R0.  The  same  is 
true  of  all  the  other  6r's.     We  can  therefore  write 

12)  x0=  Oi  +  F1+ft(r/).  Vf+fjVf).  fz+.-.+  ^.^tt).  vj-1, 

where  y>2>  9u  •  •  ■  are  rational  functions  of  Vxp  in  the  domain 
())('.  9t",  .  .  .  ).  From  this  it  appears  that  in  11)  the  radicals 
V  /''■•  \ '/£,,...  do  not  admit  of  multiplying  every  term  by  an 
arbitrary  root  of  unity,  as  indeed  is  already  evident  d  priori  since 
otherwise  x„  would  have  not  p,  but  p9  values. 

A  still  further  transformation  of  12)  is  possible.     We  have 

f/R;=  Ge  t/Rf  =  cS(i?0)  •  f/RJ. 

From  §  221  there  are  alterations  in  the  VuVat...  Va_1  which  convert 
R0  into  Rk  and  consequently  */ R0  into  «>"  "* '  *J~Rk.  The  form  of 
the  exponent  of  oj  evidently  involves  no  limitation.  At  the  same 
time  the  a?0  becomes 


THE    ALGEBRAIC    SOLUTION    OF    EQUATIONS.  263 

and  since  Rx  becomes  Rk  +  l,  it  follows  that  %/ R1  becomes 


If  now  we  apply  these  transformations  to  the  equations  above, 
we  obtain 

We  can  therefore  also  write 

x0=G0+tfR0  +  Z/Rh  +\/i^-+... 

+  ^(Bo)  •  Z/R7  +  &(-«*)  •  &I&+  MX**)  ■  Z/I&  +  •  •  • 

+  c^o) .  #js?  +  ^(r*)  •  Vr7[+  0,(jr,»)  •  \/iv2  + . . . 


Theorem  X.  ITje  roote  o/  a  solvable  equation  of  prime 
degree  p  can  be  written  in  either  of  the  two  forms  12)  or  13).  In 
13)  v  -ft/.- ,  V  -^2*5  •  •  •  are  rational  functions  of  \/ R0.      The  values 

R0,  Rk,  R2k,  .  .  .  R(p-i_Ak 

are  roots  of  a  simplest  Abelian  equation,  the  group  of  which  is  com- 
jyosed  of  the  powers  of 

9=(R0RkR3k...) 

Its  roots  are  connected  by  tlie  relations 


14)  VBk=f(B0)  ■  ViC",    </B2k  =f(Bk)  ■  VRA 

#B^=f{Ba).# '2^7,... 
where  Gjk=f(IZ0). 

§  224.  The  form  13),  together  with  the  relations  14)  between 
i?0,  Bk.,  .  .  .,  is  not  only  necessary  but  also  sufficient  for  a  root  a*0  of 
an  irreducible  solvable  equation  of  prime  degree  p.  For  14)  shows 
that  all  the  possible  permutations  among  the  i?'s  are  simply  powers 
of  ff.  If  now  <ra  converts  i?0  into  Rak,  then  ->/ JR0  will  become 
some  w^v  -fro  >  an<3  from  14) 


\/Rk.z=f(R0) .  V-Ko**  becomes  <o^'f(R0) .  fy ' Ru'k,  etc. 


264  THEORY    OF     SUBSTITUTIONS. 

Consequently  13)  becomes 


+  MRo)  ■  f#BC  +  *x(Bti  ■  a**+i  #i£  +  •  •  • 

+  ... 
That  is,  x0  has  only  the  p  values  x0,  xly  . .  .  xp_1. 

§  225.     We  will  examine  further  the  Abelian  equation  of  degree 
P— 1 


m 


k      ~  9{R)  =  0, 

which  is  satisfied  by  R0,  Rk,  .  .  .  R(,„-i)k.    From  14)  we  have 

Rh  =r(R0).R/; 
Rak=f^(Rk)^(R0).R(fh, 


and  since  Rmk  =  R0,  it  follows  from  these  equations  that 

1  =  J^-1-1[/'*-1-*(i20)  .fp-l-2k{Rk) . .  .f  (2,-i-3?, 

i=*r*",-,[jr*"I"*(Bi,)  ■r*-I-*(R») . .  ./W] . 

Now  the  primitive  congruence  root  e  for  p  can  be  so  chosen  that 
ep~l —  1  is  divisible  by  no  power  of  p  higher  than  the  first.     For  if 

e*-1=l     (mod.p2) 
then 

(p  — e)p-1=e*-1  —  (p  —  l)pep-2=Le1'-l+pep-7E^l+pep-2 

(mod.  p2), 
so  that  (p  —  e)p~1  is  divisible  only  by  p,  and  we  can  therefore  take 
p  —  e  in   place  of  e.     In  ep~x —  l=p.3,  then,  g  is   prime  to  p. 
Consequently  we  can  determine  t  so  that 

tq  +  \=0     (mod.  p). 
Suppose  that 

tq  =  sp  —  1 . 

Substituting  this  in  equation  15),  and  taking  the  pih  root  of  the  2th 
power,  we  have 

1  =  Rp-*[f+M*  (R<t)  .fp-l-2k(Rk)  ...J, 

i=Rh'*-i[rp-1-\Rk)  .rp-l-2\R2k) . . .]', 


THE    ALGEBRAIC    SOLUTION    OF    EQUATIONS.  265 

Again,  if  we  write 

16)  /'(*.*)=<*. 

.and  take  again  the  pth  root  we  have 

t/ILh  =  Rk°[af-l-h.<h<p-l-*h  . . .  a,]*, 


Since  by  equations  16)  the  a0's  are  rational  functions  of  the  roots  of 
an  Abelian  equation,  the  aa's  are  themselves  roots  of  an  Abelian 
equation.     The  substitution 

a  —  (R0  RA.  R2k  .  .  . ) 

of  the  former  corresponds  to  the  substitution 

t  =  (a0  ax  Oi . .  . ) 

of  the  latter.  If  the  roots  a0,ah,a.2,  .  .  .  are  different  from  one 
another,  then  Rak  is  a  function  of  aa 

Ra,=  <H«a), 

and  this  function  is,  in  fact,  the  same  for  all  values  of  a  (§  189). 

Theorem  XI.     The  quantities   ty  R  can  be  reduced  to  the 
form 

f/R0=  <P(a0)  •  [<*-'"* •  a{P~X-2k  .  . .  «,„_,]', 
17)  fyBk  =  #(a0  .  [a^-1-^  .  af~l~2k  .  .  .  a,]*, 


This  form  contains  the  roots  a0,  a,,  .  .  .  am_,  o/  a  simplest  Abelian 
equation.  (P  is  an  arbitrary  function.  The  form  17)  is  not  only 
necessary  but  also  sufficient. 

The  last  statement  remains  to  be  proved. 

In  the  first  place  the  R's,  as  rational  functions  of  the  (distinct) 
roots  of  an  Abelian  equation,  are  themselves  roots  of  an  Abelian 
equation  with  the  group  1,  a,  <r'\  .  .  .  v'"~\  which  corresponds  to  the 
group  1,  r, -r2,  .  .  .  r'"^1.     Again  the  first  two  equations  of  17)  give 


rfl(q,).a-«1' 


0(ao).e 
=  f(R0).R*, 

so  that  we  are  brought  back  to  the  characteristic  equations  14).* 

*Cf.  Abel:  Oeuvres,  II  pp.  217  fif.  (Edition Of  Sylow  and  Lie);  and  Kronecker:  Mo- 
natsber.  d.  Berl.  Akad.,  1853,  June  20. 

* 


CHAPTER  XIV 


the  group  or  ax  AL<;i;r>iiAic  equation-. 

$  226.  We  have  already  seen  in  Chapter  IX,  §  153  that  every 
special,  or  affect,  equation  /(.f)  =  0  is  completely  characterized  by 
a  single  relation  between  its  coefficients  or  between  its  roots.  Sup- 
pose that  in  any  particular  case  the  relation  is 

More  accurately  speaking,  it  is  not  the  function  <p  itself,  but  the 
family  of  <p  and  the  corresponding  group  G,  which  characterize  the 
equation.  Only  those  substitutions  among  the  roots  are  permissi- 
ble, which  belong  to  G.  For  this  group  we  have  the  fundamental 
theorem : 

Theorem  I.  Given  an  equation  f(x)  —  0  and  a  correspond- 
ing rational  domain  ?.l,  all  rational  integral  functions  of  the  roots 
of  the  equation  which  are  rational  within  ".)i  are  unchanged  by  the 
group  G  of  the  equation,  i.  e.,  they  belong  to  the  family  of  G  or  to 
an  included  family.  Conversely,  all  integral  function*  of  the  roots 
which  are  unchanged  by  G  are  rational  within  9t. 

The  algebraic  character  of  a  given  equation,  for  example  one 
with  numerical  coefficients,  is  therefore  by  no  means  determined  by 
the  knowledge  of  the  cofficients  alone;  but,  as  was  first  indicated  by 
Abel,  and  then  systematically  elaborated  by  Kronecker,  the  bounda- 
ries of  the  rational  domain  must  also  be  designated.  The  solution 
of  the  equation  >  -2  =  0,  for  example,  requires  very  different 
means,  according  as  s/'l  is  or  is  notincluded  in  the  rational  domain. 
The  rational  domain  can  be  defined  on  the  one  hand  by  assigning 
the  elements  91',  l)i",  .  .  .  ,  from  which  it  is  constructed.  Or  we  may 
construct  the  Galois  resolvent  equation  and  determine  one  of  its  irre- 
ducible factors  in  the  rational  domain.  The  latter  does  not,  to  be 
sure,  entirely  replace  the  assignment  of  3t',  "M",  .  .  .  ,  but  it  furnishes 


THE  GROUP  OF  AN  ALGEBRAIC  EQUATION.  207 

everthing  which  is  of  importance  from  the  algebraic  standpoint  for 
the  equation  considered. 

The  determination  of  the  irreducible  factor  gives  at  once  the 
group  of  the  equation;  in  the  n\  factors 

^  —  (".-,  »i  +  I',-,  *a  +  •  •  •  +  ",-„  a?») 
of  which  the  Galois  resolvent  is  composed,  we  have  only  to  regard 
the  u's  as  undetermined  quantities,  and  to  form  the  group  of  the  tt's 
which  permute  the  factors  of  the  irreducible  factor  among  them- 
selves. 

It  must  be  always  borne  in  mind  that  from  the  algebraic  stand- 
point only  those  equations  have  a  special  character,  according  to 
Kronecker  an  affect,  for  which  the  Galois  resolvent  of  the  (n!)tb 
degree  is  factorable. 

§  227.  On  account  of  the  intimate  connection  between  an  equa- 
tion and  its  group,  we  may  carry  over  the  expressions  "  transit  ive," 
'•primitive"  and  "non-primitive,"  "simple"  and  "compound"  from 
the  group  to  the  equation.  Accordingly  we  shall  designate  equations 
as  transitive,  primitive  or  non- primitive,  simple  or  compound,  when 
their  groups  possess  these  several  properties.  Conversely,  we  apply 
the  term  "solvable,"  which  is  taken  from  the  theory  of  equations, 
also  to  groups,  and  speak  of  solvable  groups  as  those  whose  equations 
are  solvable.  Since,  however,  an  infinite  number  of  equations  belong 
to  a  single  group,  this  usage  must  be  justified  by  a  proof  that  the 
solution  of  all  the  equations  belonging  to  a  given  group  is  furnished 
by  that  of  a  single  one  among  them.  This  proof  will  be  given 
presently  (Theorem  V). 

In  the  first  place  we  attempt  to  reproduce  the  properties  of  the 
groups  in  the  form  of  equivalent  algebraical  properties  of  their  equa- 
tions.    We  have  already  (§  156) 

Theorem  II.  If  an  equation  is  irreducible,  its  group  is 
transitive;  conversely,  if  the  group  of  an  equation  is  transitive,  the 
equation  is  irreducible. 

§  228.  To'determine  under  what  form  the  non-primitivity  of  the 
group  reappears  as  a  property  of  the  equation,  we  recur  to  the  treat- 
ment of  those  irreducible  equations  one  root  of  which  was  a  rational 
function  of  another.     The  equation  of  degree  m>  reduced  to  v  equa- 


2C8  THEORY    OF    SUBSTITUTIONS. 

tions  of  degree  m,  the  coefficients  of  which  were  rationally  expressi- 
ble in  terms  of  the  roots  of  an  equation  of  degree  v  (§  174).  We 
arrive  in  the  present  case  at  a  similar  result. 

Suppose  that  the  group  G  of  the  equation  f(x)  =  0  is  non-prim- 
itive; then  the  roots  of  the  equation  can  be  distributed  into  v  sys- 
tems of  m  roots  each 

such  that  every  substitution  of  the  group  which  converts  one  root 
of  any  system  into  a  root  of  another  system  converts  the  entire 
former  system  into  the  latter.  We  take  now  for  a  resolvent  any 
arbitrary  symmetric  function  of  all  the  roots  of  the  first  system 

1)  V\  —  '-5  \p?n  ?  *^i2»  •  •  •  •* "i"' ' 

and  apply  to  S  all   the  substitutions  of  G.     Since  G  is  non-primi 
tive,  the  entire  system  xu,  xn  . .  .  xlm  is  converted  either  into  itself 
or  into  one  of  the  other  systems.     There  are  therefore  only  v  values 
of  y 

V\    —'J  (pCllI    «^12  5    •    •    •   •*']»i/> 
V/j    —  0^3^215    ^*22  ?   •   •   •  *~tm)l 
")  \      Vz   ~  &[XZXi   ***32J   •   •   •  XZm)i 


Consequently  y  is  a  root  of  an  equation  of  degree  v 

3)  Ky)=o, 

the  coefficients  of  which  are  unchanged  by  all  the  substitutions  of 
G,  and  which  are  therefore,  from  Theorem  I,  rationally  known.  If 
c  (,//)  --0  lias  been  solved,  i.  e.,  if  all  its  roots  ylt  y2i . . .  yv  are 
known,  then  all  the  symmetric  functions  of  every  individual  sys- 
t'  in  are  also  known.  Tor  each  of  these  functions  belongs  to  the 
same  group  as  the  corresponding  y,  and  can  therefore  be  rationally 
expressed  in  terms  of  the  latter  and  of  the  coefficients  of  f(x).  If 
we  denote,   in  particular,  the  elementary  symmetric   functions   of 

**-a\  >  XgQ  i  •  •  •  3  am     Oy 

<V.'/J-  >Vi/a),  — s',„'//a), 
then  the  quantities  a •„, .  a  a..,  .  .  .  xa„,  are  the  roots  of  the  equation 
4)  ar—Sl(vJar-1+SafoJar-*—..  .  ±Sa(ya)  =  0 


THE  GROUP  OF  AN  ALGEBRAIC  EQUATION.  209 

Consequently  f(x)  can  be  obtained  by  eliminating  y  from  3)  and  4), 
and  we  have 

V 

f(x)==  JT'[xmS1{ya)  Jt-'"-1  +  S,(ya) .,---—  . . .  ±  SJya)~]  =  0. 


a  =  1 


Conversely,  if  we  start  from  the  last  expression,  as  the  result  of 
eliminating  y  from  3)  and  4),  then  the  group  belonging  to  f(.r)  =  0 
is  non  primitive,  if  we  assume  that  8)  and  4)  are  irreducible.  For 
we  form  first  a  symmetric  function  of  the  roots  of  4).  This  is 
rational  in  ya.      We  denote  it  by  F(ya).     Again  we  form  the  product 

5)  [u— F{y$\  \u—F(y$\  .  .  •  [u— i%„)] 

for  all  the  roots  of  4).  This  product  is  rationally  known;  for  its 
coefficients  are  symmetric  in  ?/, ,  y,.  .  .  .  yv,  and  are  therefore  ration- 
ally expressible  in  the  coefficients  of  3).  Accordingly  5)  remains 
unchanged  by  all  the  substitutions  of  the  group,  i.  e.,  every  substi- 
tution of  the  group  interchanges  the  linear  factors  of  this  product 
only  among  themselves.  If  therefore  F(ya)  can  be  expressed  in 
terms  of  the  ac's  in  only  one  way,  it  follows  that  the  group  converts 

the   symmetric   functions  of  .ra]..ra. vam  into   those  of  another 

system.  The  group  is  therefore  non- primitive.  But  if  the  roots  of 
fix)  are  different  from  one  another,  the  assumption  in  regard  to 
F(ya)  can  be  realized  by  §  111. 

Theorem  III.  The  group  of  an  equation  of  degree  m>, 
which  is  obtained  by  the  elimination  of  y  from  the  two  irreducible 
equations 

3)  <p(y)=y— A.y"-1-^...  ±AV  =  Q, 

4)  xmSi(y)  xm  ~ ]  +  S,(y)x"'-2^-  ...±  S„,(y)  =  0 

is  non  primitive;  and  conversely  every  equation,  the  group  of  which 
is  non-primitive  is  the  result  of  such  an  elimination. 

§  229.  The  properties  of  an  equation  the  group  of  which  is  com- 
pound do  not  present  themselves  in  so  apparent  a  form  as  in  the  case 
of  the  transitivity  or  non-primitivity  of  the  group.  We  can  however 
replace  the  problem  of  the  solution  of  the  equation  by  another  equiv- 
alent problem  in  which  the  compound  or  the  simple  character  of  the 
group  has  an  easily  observed  effect  on  the  equation  itself. 


270  THEORY    OF    SUBSTITUTIONS. 

For  this  purpose  we  have  only  to  take  in  the  place  of  the  general 
equation 

6)  /(*)  =  0 

its  Galois  resolvent  equation 

7)  F(£)  =  0. 

F(£)  is  irreducible.  We  have  first  to  examine  more  closely  the 
latter  equation  and  its  properties. 

Given  a  general  equation  6),  there  is  a  linear  function  of  the 
roots  of  6),  formed  with  n  undetermined  j)arameters 

8)  ?,  =  «,  •'-,  +  a2 .r,  -f-  .  .  .  -f  a„  .»■. .  . 

which  has  n\  values;  so  that  all  the  substitutions  of  the  symmetric 
group  G  belonging  to  0)  convert   r,  into  n\  different,  values 

Mj   ^2i   *8J    •   •   •   ■»»! 

The  permutations  among  the  --, ,  =2,  ■ . .  £„i  produced  by  G  form  a  new 
group  among  the  n\  elements  r,  which  we  denote  by  /'.  /'  is  simjily 
isomorphic  to  6r,  and  is  the  group  of  the  equation  7).  /'  has  the 
property  that  its  order  is  equal  to  its  degree,  as  appears  either 
from  the  method  of  its  construction,  or  from  the  fact  that  every  r  is 
a  rational  function  of  every  other  one.  The  equation  7),  which  is 
identical  with 

7')  (*— *0(*—*0.  •■(*—*■!)  =  o. 

therefore  requires  for  its  complete  solution  only  the  determination 
of  a  single  root.     The  solution  of  7)  is  equivalent  to  that  of  6). 

The  question  arises,  how  these  relations  are  modified,  if  we  pass 
from  the  general  equation  6)  to  a  special  equation.  Every  special 
equation  is  characterized  by  a  single  relation  between  the  roots 

If  <f  belongs  to  a  group  G  of  the  order  r,  then  only  the  substi- 
tutions belonging  to  G  can  be  applied  to  the  roots.  For  if  a  sub- 
stitution were  admitted  which  converted  <p  into 

c ,(•'',.  .'•_,.  .  . .  x„)=0, 

where  cr,  is  different  from  e,  then  all  rational  functions  of 


THE  GROUP  OF  AX  ALGEBRAIC  EQUATION.  271 

would  be  rationally  known.  The  rational  domain  thus  determined 
would  be  more  extensive  than  that  derived  from  <p.  Consequently 
9)  would  not  represent  all  the  relations  which  exist  between  the 
roots. 

We  can  now  obtain  a  resolvent  of  our  special  equation  in  either 
of  two  ways.     Either  we  proceed  from 
8)  ? i  =  a,  -r,  -f  «,  x2  -\-  .  .  .  +  a„  xn , 

apply  to  ?,  all  the  r  substitutions  of  G,  obtain 


-  1  j  ■»  3  3  ~  3  ■  •   •  •»  r  j 

and  form  the  resolvent  of  the  rtb  degree 

10)  F^)  =  (^— *,)  (£-£2)  .  .  .  (*-£)  =  0; 

or  we  proceed  from  the  expression  F{c),  already  given  in.  7)  and  7'), 
and  observe  that  F{:)  becomes  reducible  on  the  adjunction  of  9) 
and  that  Fx(:)  is  one  of  the  irreducible  factors.  The  other  fac- 
tors are,  like  h\,  of  the  rtb  degree.  They  differ  from  each  other 
only  in  the  constants  «.  Every  one  of  them  is  obtained  by  multi- 
plying together  all  the  factors  r  —  =a ,  which  arise  from  the  applica- 
tion of  the  group  G  to  a  single  one  among  them.  The  group  of 
F,(.;)  =  0,  regarded  as  a  group  among  the  c's,  is  of  degree  and 
order  r.  It  is  simply  isomorphic  to  the  group  G  of  degree  n  and 
order  r  belonging  to  <j>. 

The  groups  of  all  the  factors  Ft(^),  ...  of  F{=)  therefore  differ 
from  one  another  only  in  the  particular  designation  of  their  elements. 

Theorem  IV.     If  a  special   equation  f(x)  =  0  is   charac- 
terized by  the  family  of 

9)  <p(x1,x2,...xn)  =  0, 

with  a  group  G  of  order  r,  then  the  general  Galois  resolvent  decom- 

"  •   /- 
poses  into  />  =  —  factors 

10)  i^)=0, 

every  one  of  which  can  serve  as  the  Galois  resolvent  of  the  special 
equation.  All  the  roots  of  10)  are  rational  functions  of  every  one 
among  them,  and  in  terms  of  these  all  the  roots  of  f(x)  =0  can  be 
rationally  expressed.  The  transition  from  f(x)  =  0  to  Fl(:)  =  0 
has  its  counterpart  in  the  transition  from  G  to  the  simply  isomor- 
phic group  Q  (§  129)  of  F^). 


2  l  2  THEORY    OF    SUBSTITUTIONS. 

Since  the  construction  of  10)  depends  only  on  the  group  G,  and 
not  on  the  particular  nature  of  9),  this  same  resolvent  belongs  to  all 
equations  which  are  characterized  by  functions  of  the  same  family 
with  9).  If  one  of  these  equations  has  been  solved,  then  a?j,  x2, . . .  <„ 
and  consequently  I,  are  known.  The  equation  10)  is  therefore  solved, 
and  with  it  every  other  equation  of  this  sort.  We  have  then  the 
proof  of  the  theorem  stated  in  §  226: 

Theorem  V.  Given  an  equation  f(x)  =  0,  the  coefficients  of 
which  belong  to  any  arbitrary  rational  domain,  the  adjunction  of 
either  cr,  =  0  or  <p%  =  0,  where  <r,  and  <p2  belong  to  the  same  family 
of  the  roots  xl,  x2,  .  .  .  oc„,  leads,  as  regards  solvability,  to  the  same 
special  equation. 

§  230.  We  have  treated  in  earlier  Chapters  cases  where  such 
relations  between  the  roots  either  were  directly  given  or  were  easily 
recognized  as  involved  in  the  data.  Frequently,  however,  ihe 
conditions  are  such  that,  instead  of  a  known  function,  (.'(.r, ,x2...  x„) 
being  directly  designated  as  adjoined,  d>  presents  itself  implicitly  as 
a  root  of  an  equation  which  is  regarded  as  solvable.  For  example, 
in  the  problem  of  the  algebraic  solution  of  equations  the  auxiliary 
equation  is  of  the  simple  form 

yp  —  A(x1,x2,  .  .  .  xn)=0. 

Here  y  is  regarded  as  known,  i.  e.,  we  extend  the  rational  domain 
of  f(x)  —  0  by  adjoining  to  it  every  rational  function  of  the  roots 
of  which  any  power  belongs  to  the  domain.  The  actual  solution  of 
the  auxiliary  equations  does  not  enter  into  consideration.  < 

It  is  a  natural  step,  when  an  irreducible  auxiliary  equation  is 
regarded  as  solvable,  to  adjoin  not  one  of  roots  d>,  but  all  of  its 
roots  to  the  domain  of  fix)  =  0.  These  roots  are  the  different  val- 
ues which  t'l',.  .*-,,  .  .  .  .*■„)  assumes  within  the  rational  domain.  For 
to  find  the  auxiliary  equation  which  is  satisfied  by  4\  we  apply  to 
<•,  all  the  /•  substitutions  of  the  group  G  and  obtain,  for  example, 
m  distinct  values 

The  symmetric  functions  of  these  values,  and  therefore  the  coeffi- 
cients of  the  equation 


THE  GROUP  OF  AN  ALGEBRAIC  EQUATION. 


273 


1 2 )  g  (</>)  =  (<P — fc)  (<P — 0a)  •  ■  •  (<P  —  <:>)  =  0 

are  known  within  the  rational  domain  of  f(x)  =  0,  and  12)  is  the 

required  auxiliary  equation,  the  solution  of  which  is  regarded  as 

known. 

Now  given  the  equation  f(x)  =  0,  characterized  by  the  group  G, 
or  by  any  function  <p{xu  x2,  .  .  .  xn)  belonging  to  G,  we  adjoin  to 
it  all  the  roots  of  12),  or,  what  amounts  to  the  same  thing,  a  linear 
combination  of  these  m  roots 

y  —  a,  </•,  +  a2  02  +  •  •  •  +  r/m  ^  > 
where  the  a's  are  undetermined  constants.     The  question  then  arises, 
what  the  group  of  f(x)  =  0  becomes  under  the  new  conditions. 

The  adjoined  family  of  functions  was  originally  that  of  <p.  Now 
it  is  that  of 

(f  +  X  =  9  +  a\  01  +  fl2  02  +   •   •   •   +  "».  ^m  • 

The  group  was  originally  G.     Now  it  is  that  subgroup  of  G,  which 
is  also  contained  in  all  the  groups 

H\ »  -HJa  >  •  •  •  Hm , 

of  0, ,  03 ,  . . .  </■„, .    Suppose  that  i^  is  the  greatest  common  subgroup 
of  these  m  groups.     Then  K  belongs  to  the  function  y . 

If  now  we  apply  all  the  substitutions  of  G  to  the  series  0, ,  02,  ■•■  0«> 
the  result  is  in  every  case  the  same  series  in  a  new  order;  for 
</\,  02,  •  •  •  0«  are  all  the  values  which  G  produces  from  0X.  Conse- 
quently the  series  iZ", ,  H 2 ,  .  .  .  Hm  is  also  reproduced  by  transforma- 
tion with  respect  to  G;  and  K  is  therefore  unchanged  by  transform- 
ation with  respect  to  G.     We  have  then 

G~lKG  =  K. 

Again  we  denote  by  /'  the  greatest  subgroup  of  G  which  is  con- 
tained in  K.  r  therefore  belongs  to  ?-}-/,  and  accordingly  char- 
acterizes the  family  which  belongs  to  f(x)  =  0  after  the  adjunction 
of  all  the  roots  of  12).  -T,  like  K,  is  also  commutative  with  G;  for 
on  transforming  /'  with  respect  to  G,  the  result  must  belong  to  both 
G  and  K,  and  is  therefore  r  itself.  F  is,  then,  a  self-conjugate  sub- 
group of  G,  and  in  fact  is  the  most  comprehensive  of  those  which 
are  also  common  to  Hx ,  H3 , . . .  Hm . 

If  r  does  not  reduce  to  the  identical  operation,  G  is  a  compound 
18 


2  I  4  THEORY    OF    SUBSTITUTIONS. 

group.  If  G  is  simple,  /'  is  necessarily  identity,  and  the  group  of 
f(x)  =  0  is  reduced  by  the  solution  of  12)  to  1,  i.  e.,  after  the 
solution  of  12)  all  the  roots  of  /(a?)  =  0  are  known;  or,  in  other 
words,  the  solution  of  12)  furnishes  that  of  f(x)  =  0  also.  We  have 
then  the  following 

Theorem  VI.  Given  any  arbitrary  equation  f(x)  =  0  with 
the  groxqy  G,  if  we  adjoin  to  it  all  the  roots 

of  an  irreducible  equation  of  the  mth  degree 
12)  g(^)  =  4>m— ^r-'+  .  . .  =0, 

the  coefficients  of  which  are  rational  in  the  rational  domain  of  f{x), 
and  the  roots  rational  functions  of  xl,  x2,  .  .  .  x„,  then  G  reduces  to 
tlie  largest  self- conjugate  subgroup  V  of  G  ichich  leaves  <plt  <J'2,  .  .  .  d>m 
all  unchanged.  If  G  is  a  simple  group,  T=  1.  Only  in  case  G  is 
compound  is  it  possible  by  the  solution  of  an  auxiliary  equation  to 
reduce  the  group  to  a  subgroup  different  from  identity,  and  conse- 
quently to  divide  the  Galois  resolvent  equation  into  non-linear  fac- 
tors. 

§  231.  We  consider  these  results  for  a  moment.  If  the  general 
equation  of  the  nth  degree  /(a?)=0  is  given,  the  corresponding 
group  G  is  of  order  r  =  nl.  This  group  is  compound,  the  only 
actual  self  conjugate  subgroup  being  the  alternating  group  (§92). 
If  we_take  for  a  resolvent 

<\  =  V  - , 

where  J  denotes,  as'usual,  the  discriminant  of  f(x),  then  the  resolv- 
ent equation  becomes 
12')  <>■—  J  =  0, 

and  /'  is  the  alternating  group.  After  adjunction  of  the  two  roots 
of  12')  the  previously  irreducible  Galois  resolvent  equation  divides 
into  two  Jconjugate  factors  of  degree  \n\,  and  only  such  substitu- 
tions can  be  applied  to  the  resolvent 

£  =  0,05,  +  O^aJj-f-  ...  +  «„  XH 

as  leave  \/  J  unchanged  and  therefore  belong  to  the  alternating 
group. 

For  n  >  4  the  alternating  group  is  simple.     If  there  is  an  m- 


THE  GROUP  OF  AN  ALGEBRAIC  EQUATION.  275 

valued  resolvent  4>  •>  its  values  4'u  4'n  •  •  •  4'm  are  obtained  by  the 
solution  of  an  equation  of  the  mth  degree.  On  the  adjunction  of 
these  values,  or  of 

Z  =  j8,  ft +&&+...  +  Pm4'm 
the  group  of  the  given  equation  reduces,  by  Theorem  VI,  to  the 
identical  substitution.  The  equation  f(-r)  =  0  is  therefore  solved; 
for  all  functions  are  known  which  belong  to  the  group  1  or  to  any 
other  group.  The  investigations  of  Chapter  VI  show,  however,  that 
no  reduction  of  the  degree  of  the  equation  to  be  solved  can  be 
effected  in  this  way,  since  if  n  >  4,  the  number  m  of  the  values  of  </', 
if  it  exceeds  2,  is  greater  than  n  or  equal  to  n.  In  the  latter  case, 
if  n==G.  the  function  4'  is  always  symmetric  in  n —  1  elements,  so 
that  we  can  take  directly  </',  =  .x\ ,  and  the  resolvent  equation  is  iden- 
tical with  the  original  f(x)  =  0. 

Theorem  VII.  The  general  equation  of  the  n"'  degree 
(n  >  4)  is  solved,  as  soon  as  any  arbitrary  resolvent  equation  of  a 
degree  higher  than  the  second  is  solved.  There  are,  however,  no 
resolvent  equations  the  degree  of  which  is  greater  than  2  and  less 
than  n.  Moreover,  if  w= 6,  there  is  no  resolvent  equation  of  the 
n"'  degree  essentially  different  from  f(x)  —  0.  For  n  =  6  there  is 
a  distinct  resolvent  equation  of  degree  6. 

One  other  result  of  our  earlier  investigations,  as  reinterpreted 
from  the  present  point  of  view,  may  be  added  here: 

Theorem  VIII.  The  general  equation  of  the  fifth  degree 
has  a  resolvent  equation  of  the  sixth  degree. 

§  232.     We  return  now,  from  the  incidental  results  of  the  pre- 
ceding   Section,  to    Theorem  VI,  and  examine  the    group  of   the 
equation 
12)  fir(^)==(^_^1)  (4>—4>2) . . .  {4>—4>m)  =  0, 

thp  roots  (/•,,  c'':.  .  .  .  (/•„,  of  which  were  all  adjoined  to  the  equation 
/(a?)  =  0. 

The  order  of  the  group  of  12)  is  most  easily  found  from  the  fact 
that  it  is  equal  to  the  degree  of  the  irreducible  equation  of  which 

w  =  /'l  V\  +  T%  <t>l  +  •  •■  •  +  Ym  <Pm 

is  a  root.     We  must  therefore  apply  to  w  all  the  r  substitutions  of 


276  THEORY    OF    SUBSTITUTIONS. 

G.  The  values  thus  obtained  may  partly  coincide.  The  number  of 
distinct  values  gives  the  order  of  the  group  of  12).  Now  if  we  retain 
the  designations  of  Theorem  VI,  /'  includes  all  substitutions  of 
.)-,,.*•,,,...  xu  which  leaves  all  the  t''s  unchanged.  Suppose  that 
the  order  of  /'is  r'.     Then  the  required  number  is  v—r:  ?•'. 

From  this  we  perceive  that,  if  the  group  G  is  simple  and  /'  ac- 
cordingly of  order  r'  =  1,  the  order  >  of  the  group  of  every  resolvent 
equation  is  the  same  as  that  of  /(.»')  =  0,  so  that  no  simplification 
can  be  effected  in  this  way. 

We  actually  obtain  the  group  of  12)  by  the  consideration  that 
it  contains  all  and  only  those  substitutions  among  the  as's  which 
do  not  alter  the  nature  of  f(x)  =  0.     If  therefore  we  apply  to 

th         iU         iU  i'i 

r  1  J  V2  J  V  8  >   •  •  •  fm 

all  the  substitutions  of  G,  the  resulting  permutations  of  the  ^'-'s  form 
the  group  required.  All  the  r  substitutions  thus  obtained  are  not 
however  necessarily  different;  for  all  the  substitutions  of  l1  leave  all 
the  elements  unchanged.  From  this,  again,  it  follows  that  the 
order  of  the  group  K  of  12)  is  v  =  r:r'.  In  the  same  way  we  recog- 
nize that  K  is  (1 — r)  fold-isomorphic  to  G.  With  the  notation  of 
§  86,  K  is  the  quotient  of  G  and  l'-  K  =  G:I\ 

Theorem  IX.  //  the  group  G  of  f(x)  =  0  is  of  order  ry 
and  contains  a  self -conjugate  subgroup  I'  of  order  r',  and  if  G 
reduces  to  /'  on  the  adjunction  of  all  the  roots  11)  of 

12)  0(0)  =  O, 

then  the  group  K  of  the  latter  equation  is  of  order  v  =r:  r'.  K  is 
the  quotient  of  G  and  r  and  is  (1  —  r)-fold  isomorphic  to  G. 

By  a  proper  choice  of  the  resolvent  <p  we  can  give  the  equation 
12)  a  very  special  character. 

We  choose  as  a  resolvent  a  function  /  belonging  to  the  self- con- 
jugate subgroup  /'.  Then  /  is  a  root  of  an  equation  of  degree 
v  =z  r:r',  all  the  roots  of  which  are  rationally  expressible  in  terms  of 
anyone  among  them;  for  ZitX*i'"Xv  a^  belong  to  the  same  group 
r,  (§  109,  Theorem  VIII).  The  group  of  12)  is  therefore  a  group  fi; 
for  it  is  transitive,  since  g(x)  is  irreducible.     We  have  therefore 

Theorem  X.     //  the  group  G  of  the  equation  f(x)  —  0  is 


THE  GROUP  OF  AN  ALGEBRAIC  EQUATION.  277 

of  order  r,  and  contains  a  self -conjugate  subgroup  V  of  order  r', 
and  if  yA  is  a  function  of  the  roots  a*,,  x2,  .  .  .  a?„,  belonging  to  /', 
then  an  irreducible  resolvent  equation  of  degree  >  =  r:  r' 

run  be  constructed,  the  roots  of  which  are  all  rational  functions  of 
a  single  one  among  them,  and  which  possesses  the  properly  /hat  the 
adjunction  of  one  of  its  roots  to  fix)  =  0  reduces  the  group  G  to  /'. 

§233.     Theorem  XI.     If   r  is  a  maximal   self- conjugate 

subgroup  of  G,  then  the  group  of  h(x)  =  0  is  a  transit! re,  simple 
group.  Conversely,  if  f  is  not  a  most  extensive  self -conjugate  sub- 
group of  G,  then  the  group  of  h(x)  =  0  is  compound. 

We  denote  the  group  of  h(x)  =  0  by  G'.  Its  order  is  v  =  r:  r'. 
We  assume  that  G'  contains  a  self- conjugate  subgroup  /'',  of  order  rv 
From  Theorem  IX  G'  is  r'-fold  isomorphic  to  G.  From  the  results 
of  §  73  it  follows  that  the  subgroup  J  of  G,  which  corresponds 
to  the  group  T',  is  a  self- conjugate  subgroup  of  G  and  is  of  order 
•/  /■'.  J  is,  then,  like  /',  a  self  conjugate  subgroup  of  G,  and 
their  orders  are  respectively  v'  r'  and  r'.  We  show  that  F  is  con- 
tained in  J.  This  follows  directly  from  the  construction  of  G'  (§  232), 
in  accordance  with  which  the  substitution  1  of  G'  corresponds  to  all 
the  substitutions  of  G  which  leave  the  series  11)  unaltered.  /'  in  G 
therefore  .corresponds  to  the  one  substitution  1  of  G'.  Accordingly 
if  G'  is  compound,  then  P  is  not  a  maximal  self-conjugate  subgroup 
of  G. 

The  converse  theorem  is  similarly  proved  from  the  properties  of 
isomorphic  groups. 

In  these  last  investigations  we  have  dealt  throughout  with  the 
group  of  the  equation,  but  never  with  the  particular  values  of  the 
coefficients.  If  therefore  two  equations  of  degree  ;/  have  the  same 
group,  the  reductions  of  the  Theorem  X  are  entirely  independent  of 
the  coefficients  of  the  equations.  The  coefficients  of  //(/)  will  of 
course  be  different  in  the  two  cases,  but  the  different  equations 
h(y)  =  0  all  have  the  same  group,  and  every  root  of  any  one  of  these 
equations  is  a  rational  function  of  every  one  of  its  roots.  This  com- 
mon  property  relative  to  reduction,  irhicic  holds  also  for  the  further 


278  THEORY    OF    SUBSTITUTIONS. 

investigations  of  the  present  Chapter,  is  the  chief  reason  for  the 
collection  of  all  equations  belonging  to  the  same  group  into  a  family. 

£  234.  We  observe  further  that  with  every  reduction  of  the  group 
there  goes  a  decomposition  of  the  Galois  resolvent  equation,  while 
the  equation  f(x)  =  0  need  not  resolve  into  factors. 

Collecting  the  preceding  results  we  have  the  following 

Theorem  XII.  If  the  group  G  of  an  equation  f(x)  —  0  is 
compound,  and  if 

G,     (?]  ,     Gr2,  .  .  .  Gr„,     1 

is  a  series  of  composition  belonging  to  G,  so  that  every  one  of  the 
groups  (?,,  G2,  •  •  •  Gv,  1  is  a  maximal  self-conjugate  subgroup  of 
the  preceding  one,  further  if  the  order  of  the  several  groups  of  the 
series  are 

ri    ri  5    r2l  '  •  •  rvi    t, 
then  the  problem  of  the  solution  of  f(x)  =  0  can  be  reduced  as  fol- 
iates.     We  have  to  solve  in  order  one  equation  of  each  of  the  de- 
grees 

r      r\     r2  rv_, 

t*!      r2      ?*3  rv 

the  coefficients  of  which  are  rational  in  the  rational  domain  deter- 
mined by  the  solution  of  the  preceding  equation.  These  equations 
are  irreducible  and  simple,  and  of  such  a  character  that  all  the 
roots  of  any  one  of  them  are  expressible  rationally  in  terms  of  any 
root  of  the  same  equation.  The  orders  of  the  groups  of  the  equa- 
tions are  respectively 

r      r,      rj  rv_l 

,        ,     — ....  ,    i  v. 

r,      r2      r3  rv 

The  groups  are  the  quotients 

G:  (!x,     Gi:G2,     G2:  G3,  .  .  .  G„_l:G„,     Gv:l. 

The  equations  being  solved,  the  Galois  resolvent  equation,  which  teas 
originally  irreducible  and  of  degree  r,  breaks  up  successively  into 

/■       /■       r  r 

r,'    tV    r8'  "'  7/    T 

factors.     After  the  last  operation  f  (x)  =  0  is  therefore  completely 
solved 


THE  GROUP  OF  AN  ALGEBRAIC  EQUATION.  279 

§  235.  The  composition  of  the  group  G  of  an  equation  fix)  =  0 
is  therefore  reflected  in  the  resolution  of  the  Galois  resolvent  equa- 
tion into  factors.  We  turn  our  attention  for  a  moment  to  the  ques- 
tion, when  a  resolution  of  the  equation  f(x)  =  0  itself  occurs.  It  is 
readily  seen  that,  in  passing  from  Ga  to  Ga+i  in  the  series  of  com- 
position of  G,  a  separation  of  f(x)  into  factors  can  only  occur  when 
Ga+\  does  not  connect  all  the  elements  transitively  which  are  con- 
nected transitively  by  Ga.  The  resulting  relations  are  determined 
by  §71.  Ga  is  non-primitive  in  respect  to  the  transitively  con- 
nected elements  which  Ga  +  1  separates  into  intransitive  systems. 

Starting  from  G,  with  an  irreducible  f(x)  =  0,  suppose  now  that 
Gl,  G-,,  .  .  .  Ga  are  transitive,  but  that  Ga+l  is  intransitive,  so  that 
by  §  71  Ga  is  non- primitive.  Then  at  this  point  f(x)  separates 
into  as  many  factors  as  there  are  systems  of  intransitivity  in  Ga  +  li 
But  (again  from  §71),  all  the  elements  occur  in  Ga+l.  We 
arrange,  then,  the  substitutions  of  Ga  in  a  table  based  on  the  sys- 
tems of  intransitivity  of  Ga  +  1.  Suppose  that  there  are  //.  such  sys- 
tems, so  that  f(x)  divides  into  fi  factors.  Then  we  take  for  the  first 
line  of  the  table  all  and  only  those  substitutions  of  Ga,  which  do 
not  convert  the  elements  of  the  first  system  of  intransitivity  into 
those  of  another  system.  The  substitutions  of  this  line  form  a 
group,  which  is  contained  in  Ga  as  a  subgroup.  Its  order  is  there- 
fore kra+1 .  The  second  line  of  the  table  consists  of  all  the  substi- 
tutions of  Ga  which  convert  the  first  system  of  intransitivity  into 
the  second.  The  number  of  these  is  also  kra+i.  There  are  //.  such 
lines,  and  they  include  all  the  substitutions  of  Ga.     Consequently 

K  'a  +  1 

i.  e.,  the  number  ,u  of  the  factors  into  which  f(x)  divides  is  a  divi- 

r 
sor  of  tlte  number of  the  factors  into  ivhich  the  Galois  resolv- 

Ta+  1 

ent  equation  divides  at  the  same  time.  A  similar  result  obviously 
occurs  in  every  later  decomposition. 

The  decomposition  can  therefore  only  take  place  according  to  the 
scheme  of  Theorem  III.  The  several  irreducible  factors  are  all  of 
the  same  order. 

§  236.     Thus  far  we  have  adjoined  to  the  given  equation  /(^)=0 


2N0  THEORY    OF    SUBSTITUTIONS. 

the  root  </■  of  a  second  irreducible  equation  only  when  the  ^'''s  were 
rational  functions  of  .»', ,  x2,  •  .  •  ocn.     This  seems  a  strong  limitation. 
We  will  therefore  now  adjoin  to  the  equation  /(a?)  =  0  all  the  roots 
of  an  irreducible  equation 
13)  g(z)  =  0 

without  making  this  special  assumption.  The  only  case  of  interest 
is  of  course  that  in  which  the  adjunction  produces  a  reduction  in  the 
group  G  of  f(x)  =  0. 

In  the  first  instance  we  adjoin  only  a  single  root  z,  of  g(z)  =  0. 
Suppose  that  G  then  reduces  to  its  subgroup  Hx .  If  the  rational 
function  <Pi(xu  x2,  .  .  .  xH)  belongs  to  Hx,  then  the  same  reduction 
of  G  can  be  produced  by  adjoining  cr,  instead  of  Zx .  Suppose  that 
under  the  operation  of  G,  the  function  c?j  takes  the  conjugate  values 
('„(•';,,..  (f,„ ,  with  the  groups  Hr,  H2,  ...  H,„  respectively.  These 
values  satisfy  an  irreducible  equation 

&(?)=(? — ?>i)  (<p  —  ?2)  .  .  .  (?■  —  <fm)  =  0. 

The  adjunction  of  zx  to  the  rational  domain  has,  by  the  mediation 
of  Hl ,  made  <fx  rational,  so  that  <px  is  a  rational  function  of  zx 

<px{xu  X2,  .  .  .  Xn)=  (frfa). 

It  appears  therefore  that,  in  order  that  the  adjunction  of  z,  may  pro- 
duce a  reduction  of  G,  it  is  necessary  and  sufficient  that  there  should 
be  a  rational  non-symmetric  function  of  the  roots  c^O,,  x2,  .  .  .  x„) 
which  is  rationally  expressible  in  terms  of  zx . 

Suppose  that  the  roots  of  the  irreducible  equation  f/(z)  =  0  are 
2, ,  z._,,  .  .  .  zM,  and  that  its  group  is  /'.  Since  A:[Y'(z)]  =  0  is  satisfied 
by  z,,  all  the 

c'.(z,.)     (»  =  1,2,8,...m) 

are  roots  of  k(<p)  =  0;  that  is  </'(z,),  <J>(z2),  .  .  ■  <t''(z,j)  are  the  conjugate 
values  of  <r, .     On  the  other  hand  the  coefficients  of  the  product 

H?)  =  |>— <K*i)]  [>— ^2)]  ■  .  ■  [?  — c'<r,j  J 
are  symmetric  functions  of  the  roots  of  g(z)  =  0  and  are  therefore 
rationally  known;  and  the  equation   kx  =  0   has  all  its  roots  in  com- 
mon with  A;  =  0.     Consequently  /.,1c)  is  a  power  of  k{<p) 

kl(<f)  =  L->(c), 
and  the  n  values  ^(z^,  </>(z2),  ■  •  •  ^''(z^)  coincide  in  sets  of  q  each. 


THE  GROUP  OF  AN  ALGEBRAIC  EQUATION.  281 

"With,  a  slight  change  in  the  notation  for  the  2's  we  can  therefore 
\v  cite 

Z)  *=#«•)  =  f«')  =...  =  ^(0,  (*m-'" 


Since  <p(z£fi) —  <p{zpW)  =  0,  this  quantity  is  rationally  known. 
It  is  therefore  unchanged  by  all  the  substitutions  of  l\  i.  c.  I'  inter- 
changes the  lines  of  %),  and  therefore  gives  rise  to  a  group  T  of  the 
elements  c>  which  is  isomorphic  to  1\  To  the  substitution  1  in  T 
correspond  in  F  the  substitutions  of  the  subgroup  ^  of  order  d{  which 
only  interchange  z\,z'2,  .  .  .  z'q  among  themselves,  z'\,  z"2,  .  .  .  z"q 
among  themselves,  and  so  on.     F  and  T  are  (1  - — d^-fold  isomorphic. 

If  we  coordinate  all  the  substitutions  of  G  and  T  which  leave  cr, 
unchanged,  and  again  one  substitution  each  from  G  and  T  which 
converts  <fx  into  p2,  one  which  converts  c^  into  cr3,  and  so  on,  an 
isomorphism  is  also  established  between  G  and  T.  To  the  substitu- 
tion 1  in  T  correspond  in  G  the  substitutions  of  the  subgroup  D  of 
order  d  which  is  the  maximal  common  subgroup  of  Hx,  H2,  .  .  .  H,„. 

Accordingly  G  and  F  are  also  isomorphic,  and  in  fact  their  iso- 
morphism is  (d —  dj-fold,  as  shown  by  the  preceding  considerations, 
and  again  (r — r^-fold,  as  appears  from  the  orders  of  G  and  /'. 
Consequently 

If  now  we  adjoin  to  the  equation  f(x)  —  0  all  the  roots  of 
g  (z)  =  0,  then  ^ ,  <p  2 ,  .  .  .  <pm  are  rationally  known.  G  reduces  to  the 
subgroup  D  of  order  d  common  to  the  groups  H , ,  H 2 ,  .  .  .  H„, .  To 
D  belongs  the  function 

14)  p(Xj  ,  .('_,,  .  .  .  Xn)  =  «jcr,  -f  a2<f2  -J-  .  .  .  +  am<pm  =  w(zliZt1  .  .  .  ZM), 

■and  every  function  ofx} ,  .r2 ,  .  .  .  x„  which  can  be  rationally  expressed 
in  terms  of  z},z2,  .  .  .  z^  belongs  to  the  family  of  <>  or  to  an  inclu- 
ded family.  For  every  such  function  is  rationally  knowu,  as  soon 
as  the  zt,  z2,  . . .  z^  are  adjoined  to  the  equation  f(x)  =  0. 

Conversely,  if  we  adjoin  to  the  equation  g  (z)  =  0  all  the  roots 
•of  f(x)  =  0,  it  follows  by  the  same  reasoning  that  there  is  a  function 

15)  •  w0(zu  z2,  ...Zp)  =p0(x1,  a^,...a?„), 


282  THEORY    OF    SUBSTITUTIONS. 

such  that  every  function  of  zx,z.±,  .  .  .  z^  which  can  be  rationally 
expressed  in  terms  of  .»', ,  x.,,  .  .  .  .<•„  belongs  to  the  family  of  u>0  or  to 
an  i  lie  haled  family. 

Since  now  /<0  is  rational  in  the  z's,  it  follows  from  the  above  prop- 
erty that 

16)  Po  =  R(p), 

where  R  is  a  rational  function;  and  since  at  is  rational  in  the  aj's,  it 
follows  that 

17)  io  —  Rv(<o0) 
or,  which  is  the  same  thing, 

17)  p  =  R0(Po)- 

From  16)  and  17')  it  follows  that  p  and  p0  belong  to  the  same 
family.  The  adjunction  of  all  the  roots  of  f—0  to  g  =  0  there- 
fore gives  rise  to  the  same  rational  domain  as  the  adjunction  of  all 
the  roots  of  g  —  0  to  /  =  0. 

It  is  obvious  at  once  that  the  first  adjunction,  since  it  made 
(?,,(.',,  .  .  .  (f,H  rational,  also  furnished  a>,  so  that  /'  reduces  to  J. 
But  the  proof  just  given  was  necessary  to  exclude  the  possibility  of 
any  further  reduction. 

r      v. 

If  we  write  —  =  -j-—-1,  it  follows  that  if  the  second  adjunction 

reduces  the  order  r  of  G  to  its  >Ul  part,  then  the  first  adjunction 
also  reduces  the  order  rt  of  r  to  its  >th  part. 

Theorem  XIII.  The  effect  of  the  adjunction  of  all  the 
roots  of  any  arbitrary  equation  13)  on  the  reduction  of  the  group 
Goff(x)=0  can  be  equally  well  produced  by  the  adjunction  of 

all  the  roots  of  an  equation  12)  which  is  satisfied  by  rational  func- 
tions Of  SCj,  x2,  . . .  xn. 

In  spite  of  removal  of  apparent  limitations,  we  have  therefore 
not  departed  from  the  earlier  conditions,  where  only  the  adjunction 
of  rational  functions  of  the  roots  was  admitted. 

§237.    Theorem  XIV.    // 

f(x)  =  0,  ?(«)  =  () 

are  two  equations,  the  coefficients  of  which  belong  to  the  same 
rational  domain,  and  which  are  of  such  a  nature  that  the  solution 


THE    GROUP    OF    AN    ALGEBRAIC    EQUATION.  283 

of  the  second  and  the  adjunction  of  all  its  roots  to  the  first  reduces 
the  </roup  of  f(x)  =  0  to  a  self -conjugate  subgroup  contained  in  it 
of  an  order  v  times  as  small,  then  conversely  the  solution  of  flic 
first  equation  reduces  the  group  of  the  second,  to  its  >th  part.  The 
group  of  f(x)  =  0,  like  that  of  g(z)  =  Q,  is  compound,  and  v  is  a 
factor  of  composition.  Those  rational  functions  of  the  roots  of 
one  of  the  two  equations,  by  which  the  same  reduction  of  its  group 
is  accomplished  as  by  the  solution  of  the  other  equation  are  rational 
in  the  roots  of  the  latter. 

As  we  see,  the  group  of  fix)  =  0  can  be  reduced  by  the  solution 
of  an  equation  g(z)=0,  although  the  roots  of  the  latter  are  not 
rational  functions  of  xx  ,x2,...  x„ .  It  is  only  necessary  that  thore 
should  be  rational  functions  of  zl ,  z2, . . .  z^  which  are  also  rational 
functions  of  x, ,  x.2 ,  .  .  .  xn . 

From  the  preceding  Theorem  follow  at  once  the  Corollaries 

Corollary  I.  If  the  group  G  of  the  equation  f(pc)  =  0  is 
simple,  the  equation  can  only  be  solved  by  tlie  aid  of  equations  with 
groups  the  orders  of  which  are  multiples  of  the  order  of  G. 

For  since  G  reduces  to  1,  the  v  of  Theorem  XIV  must  be  taken 
equal  to  the  order  of  G. 

Corollary  II.  If  the  group  G  of  f(x)  =  0  can  be  reduced 
by  the  solution  of  a  simple  equation  g(z)  =  0,  then  zn  z2, .  .  .  z^  are 
rational  functions  of  the  roots  of  f(x)  =  0. 

For  in  this  case  v  is  equal  to  the  order  of  the  group  of  g  (z)  —  0. 
After  the  reduction  this  is  equal  1.     Consequently 

'/'",  —axz^  +  a.,z,  -f-  .  .  .  +  a^Zfj,  =  <!\ixl ,  x.2,  .  .  .  x„), 

where  '/ \  is  the  Galois  resolvent  of  g(z)  =  0. 

Corollary  III.  If  the  adjunction  of  the  roots  of  g(z)  =  0 
is  to  produce  a  reduction  of  the  group  of  /(  <  )  =0,  then  the  orders 
r  and  ?-,  cannot  be  prime  to  each  other. 

The  preceding  Sections  contain  a  proof  and  an  extension,  rest- 
ing entirely  on  considerations  belonging  to  the  theory  of  substitu- 
tions, of  Theorem  II,  §  216,  where  the  subject  was  treated  purely 
arithmetically.     For  if  we  retain  the  notation  of  §  216,  it  follows 


284  THEORY    OF    SUBSTITUTION'S. 

that  since   V„v=l\   is  a  simple  equation,    Vv  is  a  rational  function 
of  the  roots  of  /(.<')  =  0,  and  so  on. 

The  proof  of  the  impossibility  of  the  algebraic  solution  of  the 
equations  of  higher  degree  might  therefore  be  based  on  the  present 
considerations. 

£  'S-)8.  As  the  adjunction  of  the  roots  of  a  new  equation  g(z)  =  0 
to  /(.r)  =  0  leads  to  nothing  more  than  the  adjunction  of  rational 
functions  of  the  roots  of  f(x)  =  0,  so  no  new  result  is  obtained,  if 
the  roots  of  both  equations  are  connected  by  a  rational  relation. 
We  prove 

Theorem  XV.    If 

f(x)  =  0,  g(z)  =  0 

are  two  irreducible  equations,  the  roots  of  which  are  connected  with 
each  other  by  rational  relations 

f\\.x\ ,  .*"_,,  .  .  .  xn\  zx,  z2,    .  .  Zfj.)  —  U, 

the  latter  can  all  be  obtained  from  a  single  relation  of  the  form 

0,(£Cj  ,x2,  .  .  .  x„)  =  x(Z\  ,*■>,■■■  2>), 
in  ivhich  the  roots  of  the  two  equations  are  separated. 

For,  if  we  denote  the  corresponding  Galois  resolvents  by  I  and  X, 
and  the  irreducible  resolvent  equations  of  f(x)  =  0  and  g(z)  =  0  by 

tf(*)=0,  G(:)  =  0, 

the  degrees  r  and  r'  of  F  and  G  are  equal  to  the  orders  of  the 
respective  groups. 

Now  '  ] .  ■'•., '•„  can  be  rationally  expressed  in  terms  of  ?,  and 

Zi,Z2,  .  .  .  Zy,  in  terms  of  ~,  so  that 

<p(x1,x2, <■.,;   :,.  :.. z,i)  =#(!,  5T)  =  0. 

The  expression  (l>  can  be  so  reduced  by  the  aid  of  F  =  0  and  G  =  0 

that  its  degree  becomes  less  than  r  in  -r  and  less  than  r'  in  %.    Then 

the  two  equations 

*(*  :)  =  0,      /•'(f)  =  0 

have  a  common  root.  Consequently,  if  we  add  X  to  the  rational 
domain,  the  resolvent  F(:)  becomes  reducible,  since  otherwise  the 
irreducible  equation  of  the  rth  degree  would  have  a  root  in  common 


THE  GROUP  OF  AN  ALGEBRAIC  EQUATION.  285 

with  an  equation  of  a  degree  less  than  r.  The  only  exception 
occurs  when  #(£,  %)  is  identically  0. 

If  this  does  not  happen,  the  adjunction  of  all  the  roots  of  g  (z)=  0 
or  that  of  ~  breaks  up  the  resolvent  of  /(a?)  =  0  into  factors,  and  we 
have  therefore  the  case  of  the  last  Section.     We  can  effect  the  same 
reduction  by  the  adjunction  of  a  rational  function  /  of  ■> \-  x2,  .  .  . 
and  we  have 

X{xux2, r„)  =  i!>(zx,  z2,  .  .  .  zj. 

If  several  such  relations  exist,  they  can  all  be  deduced  from  one  and 
the  same  equation.  The  latter  can  be  easily  found,  if  we  select  a 
function  y  such  that  all  the  others  belong  to  an  included  family. 

On  the  other  hand  if  *(,-,  1')  is  identically  0,  it  follows  that  the 
coefficients  in  the  polynomial  '!'(:.  X)  arranged  according  to  powers, 
of  f  vanish,  so  that  we  have  equations  of  the  form 

yj')      z,(:,.  :_,,  .  .  .  ^)  =  0, 

and  similarly,  if  &(%,  Z)  is  arranged  in  powers  of  '~, 

v  y  ,ri  >  •*  2  ?  •  •  ■  «*v)  ~~  '-'• 

These  equations  can  actually  make  </'— 0.  But  this  amounts- 
to  only  an  apparent,  not  an  actual  dependence  of  the  roots  of 
/{.'■)--  t)  and  g(z)  =  0.  The  function  y.2  =  0  belongs  to  the  group 
of  g(z)  =  0,  and  ^(sc,,  x2,  .  .  .  x„)  belongs  to  the  group  of  f(x)  =  0. 


CHAPTER  XV. 


ALGEBRAICALLY  SOLVABLE  EQUATIONS. 

§  239.     In  §  234  we  have  established  the  following  theorem.     If 
the  group  G  of  the  equation  f{x)  =  0  has  the  series  of  composition 

1)  G,  6t] ,  Go,  .  .  .  Gv,   J, 

and  if  the  orders  of  these  several  groups  are 

then  the  solution  of  f(x)  =0  can  be  effected  by  solving  a  series  of 
simple,  irreducible  equations  of  degrees 

r      r{      v.,  ?•„_, 

'1  '2  '3  '  vt 

the  first  of  which  has  for  its  coefficients  functions  belonging  to  G 
and  for  its  roots  functions  belonging  to  G\  ,  the  second  coefficients 
belonging  to  Gx  and  roots  belonging  to  G2,  and  so  on.  All  these 
equations 

Xi  =  0,     %z  =  0,  ...%v  =  0,     '/v+i  =  0 

have  the  property  that  the  roots  of  any  one  of  them  are  all  rational 
functions  of  one  another,  so  that  the  order  of  the  corresponding 
group  is  equal  to  its  degree  i.  e.,  the  group  is  of  the  type  i!{§  12'.)). 
We  have  now  to  examine  under  what  circumstances  all  these 
equations  yv  =  0  become  binomial  equations  of  order  p\ 

where  HK  is  rational  in  the  quantities  belonging  to  the  family  of 
6rA_i.     In  other  words,  we  have  to   determine  the  necessary  and 
sufficient  condition  that  fix)  =  0  shall  be  algebraically  solvable. 
For  this  result  it  is  necessary  that  the  factors  of  composition 

V       V       T 

,  — ,    2,  .  .  .  should  all  be  prime  numbers,  Pi,p2,Psf  ■  ■  ■    F°r  these 
^i    r2    r3 

quotients  give  the  degrees  of  the  equations  /,  =0,  /2  =  0,  /t =  0>  .  .  . 


ALGEBRAICALLY  SOLVABLE  EQUATIONS.  287 

This  condition  is  also  sufficient,  as  has  already  been  shown  in 
§§  110,  111,  Theorems  X  and  XII.  Not  that  every  function  belong- 
ing to  (7A  on  being  raised  to  the  (px)th  power  gives  a  function 
belonging  to  G^—i]  but  some  function  can  always  be  found  which 
has  this  property,  as  soon  as  the  condition  above  is  fulfilled. 

We  have  then 

Theorem  I.  In  order  that  the  algebraic  equation  f(x)  —  0 
may  be  algebraically  solvable,  it  is  necessary  and  sufficient  that  the 
factors  of  composition  of  its  group  should  all  be  prime  numbers. 

§  240.  By  the  aid  of  Theorem  XII,  §  110  we  can  give  this  theo- 
rem another  form 

Theorem  II.     In  order  that  the  algebraic  equation  f{x)  =  0 

may  be  algebraically  solvable,  it  is  necessary  and  sufficient  that  its 
group  should  consist  of  a  series  of  substitutions 

^1    M  1   *2>  '3>   •   •   •  'vi  'v  +  1 

which  p>ossess  the  two  following  properties:  1)  the  substitutions  of 
the  group  G\  =  {1,  £n  t2,  .  .  .  <x_ i>  h\  arc  commutative,  except  those 
which  belong  to  the  group  6rx_j  =  \  1,  fM  t.,,  .  .  .  t\_2,  t\-i\,  and  2) 
the  loivest  poiver  of  fA,  which  occurs  in  G\_x  has  for  its  exponent  a 
prime  number  (cf.  also  §91,  Theorem  XXIV). 

§  241.  Again  the  investigations  of  §  94  enable  us  to  state  The- 
orem I  in  still  a' third  form.  It  was  there  shown  that  if  the  prin- 
cipal series  of  G 

2)  G,  H ,  J,  K,  ...  1 

does  Lot  coincide  with  the  series  of  composition,  then  1 )  can  be 
obtained  from  2)  by  inserting  new  groups  in  the  latter,  for  example 
between  H  and  J  the  groups 

H',  H",  .  .  .  HM. 
Then  the  factors  of  composition  which  correspond  to  the  transitions 
from  H  to  H',  from  H'  to  H",  .  .  .  from  HA)  to  J  are  all  equal. 
Accordingly,  if  all  the  factors  of  composition  belonging  to  1 )  are 
are  not  equal,  then  G  has  a  principal  series  of  composition  2). 
We  saw  further  (§95)  that,  if,  in  passing  successively  from 
H,  H',  H",  ...  to  the  following  group,  the  corresponding  factors  of 
composition  were  all  prime  numbers,  (which  then,  as  we  have  just 


288  THEORY    OF     SUBSTITUTIONS. 

seen,  are  all  equal  to  each  other),  and  only  in  this  case,  the  substitu- 
tions of  H  are  com  mutative,  except  those  which  belong  to  J.  From 
this  follows 

Theorem  III.  In  order  that  the  algebraic  equation /(aj)  =  0 
may  be  algebraically  solvable,  it  is  necessary  and  sufficient  that  its 
principal  scries  of  composition 

G,  H,  J,  A,  .  .  .  1 

should  possess  the  property  that  the  substitutions  of  every  group  are 
commutative,  except  those  which  belong  to  the  next  following  group. 

The  substitutions  of  the  last  group  of  the  series,  that  which  pre- 
cedes the  identical  group,  are  therefore  all  commutative. 

§  242.  Before  proceeding  further  with  the  theory,  we  give  a 
few  applications  of  the  results  thus  far  obtained. 

Theorem  IV.  If  a  group  V  is  simply  isomorphic  with  a 
solvable  group  G,  then  F  is  also  a  solvable  group. 

From  §  96  the  factors  of  composition  of  G-  coincide  with  those 
of  /'.     Consequently  Theorem  IV  follows  at  once  from  Theorem  I. 

Theorem  V.  If  the  group  /'  is  multiply  isomorphic  with 
the  solvable  group  G,  and  if  to  the  substitution  1  of  G  corresponds 
the  subgroup  -  of  I\  finally  if  -  is  a  solvable  group,  then  /'  is  also 
solvable. 

The  factors  of  composition  of  /'  consist,  from  §  96?  of  those  of 
G  and  those  of  -.  Reference  to  Theorem  I  shows  at  once  the 
validity  of  the  present  theorem. 

Theorem  VI.  If  a  group  G  is  solvable,  all  its  subgroups 
are  also  solvable. 

We  write  as, usual 

-~i  =  "i  #i  +  ai&2  +•••+««  ■''»  j 

apply  to  £]  all  the  substitutions  of  G,  obtain  r,,  .%,  .  .  .  ;r,  and  form 

g(*)=(e_ *,)(*— eo  ■..(*— *.)• 

It  is  characteristic  for  the  solvability  of  G  that  g  {:)  can  be  resolved 
into  linear  factors  by  the  extraction  of  roots. 

If  now  11  of  order  r  is  a  subgroup  of  G,  and  if  the  applica- 


ALGEBRAICALLY  SOLVABLE  EQUATIONS.  289 

tion  of  H  to  I,  gives  rise  to  the  values  r, ,  _-,,  .  .  .  *      then  these 
are  all  contained  among  ?,,  --_.,  .  .  .  :,..     Consequently 

fe(|)  =  (e-^)(^-^)...(?-fn) 

is  a  divisor  of  {?(£).     Then  h{z)  is  also  resolvable  algebraically  into 
linear  factors,  i.  e.,  H  is  a  solvable  group. 

We  might  also  have  proved  this  by  showing  that  all  the  factors 
of  composition  of  H  occur  among  those  of  G. 

Theorem  VII.  If  the  order  of  a  group  G  is  a  power  of  a 
prime  number  p,  the  groiqi  is  solvable. 

The  group  G  is  of  the  same  type  as  a  subgroup  of  the  group 
which  has  the  same  degree  n  as  G  and  for  its  order  the  highest 
power  pf  which  is  contained  inn!  (of. §§  39  and 49).  That  the  latter 
group  is  solvable  follows  from  its  construction  (§  39),  all  of  its  fac- 
tors of  composition  being  equal  to  the  prime  number  p.  It  follows 
then  from  Theorem  VI  that  G  is  also  solvable. 

Theorem  VIII.     If  the  group  G  is  of  order 

r=pfpfpzypt8 .  .  . 

where  Pi,p3,p3, pt,  .  .  .    ore  different  prime  numbers  such  that 

Pi  >  PfPzyPi&  ■'•■■>     Pi>  PzyP*  ■•-■>     Pi>  Pi   ■■•■> 

then  G  is  solvable.* 

We  make  usex>f  the  theorem  of  §  128,  and  write  r  =  p*q,  where 
then  pt  >  q.  G  contains  at  least  one  subgroup  H  of  the  order'p,". 
If  we  denote  by  kp{  +  1  the  total  number  of  subgroups  of  order  p,a 
contained  in  G,  and  by  pxH  the  order  of  the  maximal  subgroup  of  G 
which  is  commutative  with  H,  then  r  =  p*i(kpl  -\-  1).  Since  r  —  pxaq 
and  q  <  p, ,  we  must  take  k  —  0  and  r  =  p{ai.  That  is,  G  is  itself 
commutative  with  H.  By  the  solution  of  an  auxiliary  equation  of 
degree  q,  with  a  group  of  order  q,  we  arrive  therefore  at  a  function 
belonging  to  the  family  of  H,  and  the  group  G  reduces  to  i/(£  232), 
Theorem  X).  From  Theorem  VII  the  latter  group  is  solvable. 
Accordingly,  if  the  auxiliary  equation  is  solvable,  the  group  G  is 
solvable  also. 

The  group  of  the  auxiliary  equation  with  the  order  q  =p/p3y.. . 
admits  of  the  same  treatment  as  G.  Its  solvability  therefore  follows 
*L.  Sylow:  Math.  Aim.  V,  p.  585. 

19 


290  THEORY    OF    SUBSTITUTIONS. 

from  that  of  a  new  auxiliary  equation  with  a  group  of  order  p3Yp/ .  .  . , 
and  so  on. 

§  243.     We  return  to  the  general  investigations  of  §  241. 

The  transition  from   G  to  Gl  decomposes  the  Galois  resolvent 

r 
equation  into-=p,  factors.     The  transition  from  Gx  to  G-,  decom- 

V 

poses  each  of  these  previously  irreducible  factors  inte  —  =J92  new 

factors,  and  so  on. 

Since  f(x)  =  0  was  originally  irreducible,  but  is  finally  resolved 
into  linear  factors,  it  follows  from  §  235  that  once  or  oftener  a  reso- 
lution of  /(.*■)  or  of  its  already  rationally  known  factors  will  occur 
simultaneously  with  the  resolution  of  the  Galois  resolvent  equation 
or  of  its  already  known  rational  factors.  The  number  of  factors 
into  which  f(x)  =  0  resolves,  which  is  of  course  greater  than  1,  must 
from  §  235,  be  a  divisor  of  the  number  of  factors  into  which  the 
Galois  resolvent  equation  divides.  In  the  case  of  solvable  equa- 
tions the  latter  is  always  a  prime  number  Pi,p2,Pa,  ■  •  ■  Conse- 
quently the  same  is  true  of  f(x)  =  0.  All  prime  factors  of  the 
degree  n  of  the  solvable  equation  f(x)  =  0  are  factors  of  composi- 
tion of  the  group  G,  and  in  fact  each  factor  occurs  in  the  series  of 
composition  as  often  as  it  occurs  in  n. 

To  avoid  a  natural  error,  it  must  be  noted  that  if  in  passing 
from  G  to  GK  the  polynomial  f(.r)  resolves  into  rational  factors 
one  of  which  is  f\(x),  this  factor  does  not  necessarily  belong  to  the 
group  GK-  It  may  belong  to  a  family  included  in  that  of  G\. 
The  number  of  values  of  f\(x)  is  therefore  not  necessarily  equal 
to  r:i\.  It  may  be  a  multiple  of  this  quotient.  And  the  product 
f'\(x)  f"\(x)  ...  of  all  the  values  of  f\(x)  is  not  necessarily  equal 
to  /(.').  but  may  be  a  power  of  this  polynomial. 

We  will  now  assume  that  n  is  not  a  power  of  a  prime  number  p, 
so  that  n  includes  among  its  factors  different  prime  numbers.  Then 
different  prime  numbers  also  occur  among  the  factors  of  composi- 
tion of  the  series  for  G,  and  consequently  (§  94,  Corollary  I)  G  has 

a  principal  series 

G,  H,J,K,...  M,  1. 

Suppose  that  in  one  of  the  series  of  composition  belonging  to  0 
other  groups 


ALGEBRAICALLY  SOLVABLE  EQUATION8.  -J'.*  1 

3)  H',  H",  .  .  .  H^> 

occur  between  H  and  J.  Since  n  includes  among  its  factors  at 
least  two  different  prime  numbers,  f(x)  must  resolve  into  factors  at 
least  twice  in  the  passage  from  a  group  of  the  series  of  composition 
to  the  following  one.  Since  the  number  of  the  factors  of  f(x)  is  the 
same  as  the  factor  of  composition,  and  since  the  latter  is  the  same 
for  all  the  intermediate  groups  3),  the  two  reductions  of  fix)  cannot 
both  take  place  in  the  same  transition  from  a  group  //  of  the  prin- 
cipal series  to  the  next  following  group  J.  It  is  to  be  particularly 
noticed,  that  all  the  resolutions  of  f(x)  cannot  occur  in  the  transition 
from  the  last  group  M  to  1,  that  is,  within  the  groups 

31',  M",  ...M^~l\l, 
following  M  in  the  series  of  composition.  At  least  one  of  the  resolu- 
tions must  have  happened  before  M.  Suppose,  for  example,  that  the 
first  resolution  occurs  between  H'  and  H".  Then  it  follows  from 
§  235  that  H'  is  non-primitive  in  those  elements  which  it  connects 
transitively,  and  that  H"  is  intransitive,  the  systems  of  intransitivity 
coinciding  with  the  system  of  non- transitivity  of  H'.  The  same  in- 
transitivity then  occurs  in  all  the  following  groups  H'",  .  .  .  H^\  and 
likewise  in  the  next  group  J  of  the  principal  series,  which  by  assump- 
tion is  different  from  1. 

Suppose  that  J  distributes  tbe  roots  in  the  intransitive  systems 

x\  ,x'2,...  x'r,     x'\ ,  x"2 . . .  x"r,     .  . .    x^\  x(p,  .  .  .  #«, 

these  systems  being  taken  as  small  -as  possible.     Then  the  expression 

f\(x)  —  {x  —  x\)  (x — xf2)  . . .  x  —  x',) 

becomes  a  rationally  known  factor  of  f(x),  which  does  not  contain 
any  smaller  rationally  known  factor.  Since  from  the  properties  of 
the  groups  of  the  principal  series 

G~lJG  =  J, 
all  the  values  of  f\(x)  belong  to  the  same  group  J.    They  are  there- 
fore all  rationally  known  with  f\(x).     Of  the  values  of  f',\(x)  we 
know  already 

fx(x)  =  (X  —  X\)       (x  —  x'.2)        .  .  .  (x  —  .r'  ). 

f\(x)  =  (x—x'\)    (x—x",)    .  .  .  {x  —  x",), 


fKW(x)  =  (x—x^)  (x—x2C">) .  . .  {x—xjrt). 


292  THEORY    OF    SUBSTITUTIONS. 

If  there  were  other  values,  these  must  have  roots  in  common  with 
some /Ala' (.r).  Then  J\{a'(x)  and  consequently  /"A(.c)  would  resolve 
into  rational  factors.     This  being  contrary  to  assumption,  f\(x)  has 

only  m  =  -    values,  and  is  therefore  a  root  of  an  equation  of  degree 

m.     If  this  equation  is 

n  ?(y)     (/y-A)  (y— /"a)  •  •  •  (y-f\"n))  =  0, 

then  f(jr)  is  the  result  of  elimination  between  4)  and 

5)  f\(x)  =  x<— Uy'y-1Jr  Uv')^-2—  ■  ■  •  =  0, 

where 

M^)  =  x'1  +  x'2+x'3-\-  ...+a-';. 

4 ■..  (//')  =  x\  x',  +  X\X%  +  .  .  .  +  X'i _i  X'{ , 


so  that  0,,  c\,,  .  .  .  are  rationally  expressible  in  terms  of  f\.  Since 
/(#)  is  the  eliminant  of  4)  and  5),  it  follows  from  §  228  that  the 
group  of  f(x)  —  0  is  non-primitive. 

These  conclusions  rest  wholly  on  the  circumstance  that  J  belongs 
to  the  principal  series  of  G,  and  that  accordingly  G~^J  G  =  J.  It 
is  only  under  this  condition  that  all  the  values  of  f\(x)  which  occur 
in  the  rational  domain  of  f(x)  =  0  are  rationally  known.  This  shows 
itself  very  strikingly  in  an  example  to  be  presently  considered. 

Theorem  IX.  If  the  degree  n  of  an  irreducible  algebraic 
equation  is  divisible  by  two  different  prime  numbers,  then  n  can 
always  be  divided  into  tiro  factors  n  =  im,  such  that  the  given  equa- 
tion fix)  =  0  resolves  into  m  new  ones 

j\(x)  =  0,f\(x)  =  0,...  fW(x)=0, 

which  are  all  of  degree  i,  and  the  coefficients  of  which  are  obtain- 
able from  known  quantities  by  the  solution  of  an  equation  of  degree 
m.*     The  group  of  the  equation  /(as)  =  0  is  non-primitive. 

For  the  purpose  of  comparison  we  consider  the  solution  of  the 
general  equation  of  the  fourth  degree,  to  which,  since  4  =  2a,  the 
preceding  results  are  not  applicable.  It  appears  at  once  that  both 
of  the  resolutions  of  the  polynomial  into  linear  factors  take  place 
in  the  domain  belonging  to  the  last  group  of  the  principal  series 
M.  M',  M",  ...  1.  The  series  of  the  equation  consists  of  the  follow- 
ing groups: 

♦Abel:  Oeuvres  completes  II,  p.  191. 


ALGEBRAICALLY    SOLVABLE    EQUATIONS.  293 

1)  the  symmetric  group; 

2)  the  alternating  group: 

3)  [1,  {xxx2)  i.  <■;.<,  i.  !••■  .-'■  I  ''■'■,)  (•'•,■'•,)  (■'■.■'•>  |; 

4)  [1,  (a-, .*■..)  (as ,.p4)],  4:,)[l1{x1xi)(x2xi)'\,  or  4")  [1,  (.r,.rj  {,■.,-,  ]: 

5)  the  group  1. 

The  principal  series  consists  of  the  groups  1 ),  2 ),  3),  5).  The  passage 
from  3)  to  4)  and  that  from  4)  to  5)  both  give  the  prime  factor  2. 
The  group  4)  is  the  first  intransitive  one.  For  this/Cr)  resolves  into 
the  two  factors  (x —  a^)  (x —  x2)  and  (x —  sr8)  (•»• — -''J-  But  since 
the  group  4)  does  not  belong  to  the  principal  series,  all  the  six  val 
uesof  (as —  .<,)  (x — a?2)  are  not  known.  If  we  had  chosen  the  group 
4')  instead  of  4),  we  should  have  had  the  two  factors  (x  —  a:,)  (x —  x3) 
and  (x — x2)  (x — a?4),  and  so  on.  The  product  of  these  six  values 
give  the  third  power  of  /(a?)=(as —  xx)  (x  —  x2)  (x — x3)(x  —  a%). 
We  can  therefore,  to  be  sure,  resolve  f(x)  into  a  product  of  two 

factors  of  the   second    degree.     But  the    coefficients  of  every  such 

4 
factor  are  the  roots  not  of  an  equation  of  degree  -~  =  2,   but  of   an 

equation  of  degree  6. 

If  we  consider  further  the  irreducible  solvable  equations  of  the 
sixth  degree,  it  appears  that  these  are  of  one  of  two  types,  accord- 
ing as  we  eliminate  y  from 

x2  —  f (y)x  +  f, (y)  =  0,    y3 — c, y'1  +  c2y—c3  =  0, 
or  from 

x3—f1(y)x'2  -\~My)x—f3(y)  =  0,    y'  —  c,  y  +  e2  =  0. 

§  244.  The  preceding  results  enable  us  to  limit  our  considera- 
tion to  those  equations  f(x)  =  0  the  degree  of  which  is  a  power  of  a 
prime  number  p.  For  otherwise  the  problem  can  be  simplified  by 
regarding  the  equation  as  the  result  of  an  elimination.  Further- 
more we  may  assume  that  such  a  resolution  into  iactors  as  was  con- 
sidered in  the  preceding  Section  does  not  occur  in  the  case  of  our 
present  equations  of  degree  />A,  since  otherwise  the  same  simplifica- 
tion would  be  possible.  We  assume  therefore  that  the  group  of  the 
equation  is  primitive,  thus  excluding  both  the  above  possibilities. 

With  this  assumption  we  proceed  to  the  investigation  of  the 
group.     Suppose  that  the  degree  of  the  equation  is  pK  and  that  its 
principal  series  of  composition  is 
2)  G,  H,J,K,...  M,  1, 


294  THEORY    OF     SUBSTITUTIONS. 

In  passing  from  G  through  H,  J,  .  . .  to  M,  no  resolution  of 
f(x)  into  factors  can  occur.  Otherwise  we  should  have  the  case  of 
th°  last  Section,  and  G  would  be  non- primitive.  The  passage  from 
G  to  .1/  "prepares"  the  equation  f(x)  for  resolution,  but  does  not 
as  yet  resolve  f(x)  into  factors.  The  /.  resolutions  of  the  equation 
of  degree  pA  therefore  occurs  in  passing  from  the  last  group  of  the 
principal  series  to  identity,  that  is,  in 

M,  M',  M",  .  .  .MK~\  1. 

Accordingly  we  must  have  *>,/.  The  application  of  §94,  Corol- 
lary IY  shows  that  all  the  substitutions  of  M  are  commutative. 
The  equation  characterized  by  the  family  of  M  is  therefore  an 
Abelian  equation  of  degree  pK  (§  182).  From  §  94  there  belongs  to 
every  transition  from  one  group  to  the  next  in  the  last  series  the 
factor  of  composition  p,  so  that  the  order  of  M  is  equal  to  pK. 
Again  M  can  be  obtained  by  combining  ?.  groups  which  have  only 
the  identical  operation  in  common,  which  are  similar  to  each  other, 
and  are  of  order  p.     Suppose  that  these  are 

From  the  above  properties  it  appears  that  every  one  of  these  groups 
is  composed  of  the  powers  of  a  substitution  of  order  p 

S,  Si,  S2 ,  .  .  .  SK  _  ] , 

and  that  on  account  of  the  commutativity  of  the  groups  (cf.  §  95) 
we  must  also  have 

sS  sp"  =  af  sa"     («,  /9  =  0, 1,  ...  y.  —  1). 
Consequently  every  substitution  of  M  can  be  expressed  by 

.S'   Sj    s2    .  .  .  s  K  _  j , 
and  from  the  same  commutative  property 

Every  substitution  of  the  group  M  is  of  order  p.  Our  Abelian 
equation  therefore  belongs  to  the  category  treated  in  §  18G,  and  its 
substitutions  are  there  given  in  the  analytic  form 

/      \znz..,  .  .  .zK     «,  +  «,,  z,  +  «,,  .  .  .zK  +  aK\     (mod.  p). 

The  symmetric  occurrence  of   all  the  indices  zx ,  z3, . . .  zK  already 


ALGEBKAICALLY    SOLVABLE    EQUATIONS.  '20," 

shows  that  in  the  reduction  of  M  to  1  exactly  /.  resolutions  of  the 
polynomial  f(x)  will  occur,  as  is  also  recognized  if  we  write  for 
example 

M'=\Zi,Z3,za,...zK     Z1,Z2-\-a2,Za-\-aa,...zK  +  aK       (mod.  /o. 

Af"  =  |z,,z2,z8,  ...zK     z1,z,,z.i+ »-,,..  .zK-\-  aK  (mod.p), 

Accordingly  /.  =  /,  and  we  have  as  a  first  result 

Theorem  X.     The  last  group  of  the  principal  scries  of  a 

primitive,  solvable  equation  of  degree  pK  consists  of  the  j>K  arith- 
metic substitutions 

t=\z},  Z2,  .  .  .ZK    Zl-\-al,Z2-\-a2,...ZK-\-aK\      (mod.  p), 

the  roots  of  the  equation  being  denoted  by 

X*it*2...-*K   ,(«x  =  0,l,2,  .  .  .p— 1). 

Since  G,  the  group  of  the  equation,  is  commutative  with  M,  it 
follows  from  §  144  that  G  is  a  combination  of  arithmetic  and  geo- 
metric substitutions.     We  have  therefore  as  a  further  result 

Theorem  "XI.  The  group  G  of  every  solvable  primitive  equa- 
tion of  degree  pK  consists  of  the  group  of  the  arithmetic  substitu- 
tions of  the  degree  pK,  combined  with  geometric  substitutions  of  the 
same  degree 

u=  z,,z.,,...zK   a1z1  +  bxz,  + . . .  +  clzK,a2zl-\-b2z2  + . . .  +  c, zK, . . . 

(mod.  p). 

§  245.  Before  proceeding  further  with  the  general  investigation, 
we  consider  particularly  the  cases  x  =  1  and  x  =  2,  the  former  of 
which  we  have  already  treated  above. 

We  consider  first  the  solvable,  primitive  equations  of  prime  de- 
gree p.  We  may  omit  the  term  "  primitive,''  since  non  primitivit y 
is  impossible  with  a  prime  number  of  elements. 

The  group  of  the  most  general  solvable  equation  of  degree  p  must 
then  coincide  with  or  be  contained  in 

Cr=  |  z  az-\-a.\  (a  =1,2,  ...p  —  1;  «  =  0,1, .,.  .p    -1>     (mod./-). 

We  prove  that  the  former  is  the  case,  by  constructing  the  groups  of 
composition  from   G  to  M  and  showing  that  all  the  factors  of  com- 


2% 


THEORY    OF    SUBSTITUTIONS. 


position  which  occur  are  prime  numbers.     We  divide  p —  1  into  its 
prime  factors:  p  —  1  =  g,  q., .  .  .  ,  and  construct  the  subgroup 

p-1 


2J=  |  z  a.g,  z  +  ax\  (a,  =  1,  2, 
then  the  subgroup 
</=  \z  a2qx  q.,z  -\-  a,  I  (a2  =  1,  2,  . 


P— 1 


;  a,  =  0,  1,  .  .  .p— 1), 


;  a2  =  0,  1,  .  .  .p  —  1), 


and  so  on.     Then  H.J,  .  .  .   all  belong  to  the  principal  series  of  (?. 
Thus  we  have,  for  example  G~l  J G  =  J.    For,  if  we  take 

t  =    \  z   az  +  « |  j 

1 


then 


/ 


—  i . 


-(0-  -a) 
a 


1 


\Z   ~(z — a) 
a 


0   a2^g2z  +  «o 


0   a2q,q2z-)r 


\z  az-\-o. 
"■+"■1 


a 


so  that  the  transformation  of  a  substitution  of  J  with  respect  to  any 
substitution  of  G  leads  to  another  substitution  of  J.  Evidently  the 
principal  series  coincides  here  with  the  series  of  composition.  The 
factors  of  composition  qx ,  q.,,  .  .  .  are  all  prime  numbers.  The  proof 
is  then  complete. 

If  a  substitution  of  G  leaves  two  roots  xK  and  a?M  unchanged,  then 
it  leaves  all  the  roots  unchanged.  For  from  /  =  a/.  -\-  a,  a  =  a>  -j-  a 
follows  necessarily  a  1,  a  I),  and  the  substitution  becomes  iden- 
tical :  1  =  J  Z    z\. 

If  a  substitution  of  G  leaves  one  root  X\  unchanged  and  if  it  con 
verts  xK  +  l  into  x^,  then  every  xv  becomes  x[lx    K){v    a»  +  a-     For  from 
/      a  /  +  " , ,"      a(/-  +  1)  +  « ,  follows  a   .--,». —  / ,  a       '/.(). —  p.  -  - 1),  and 
the  substitution  is  of  the  form     z    ( :> — /)  z  -+-  /(/.-  —  //.  -f-  1  1    . 

If  a  substitution  of  G  leaves  no  root  unchanged,  and  if  it  con- 
verts xK  into  .r^,  then  every  .<-,.  is  converted  into  .»■,,  ^M„A-  For  only 
in  this  case  is  there  no  solution  /  of  the  congruence  \  cU  +  a, 
when  a~  1.  If  '•  +  1  is  to  become  />.,  then  we  must  have  />.  =  X-\-  a. 
This  gives  <>.  =  ;i. —  /,  and  the  substitution  is  !  z  z  -\- fi —  A  | . 

These  are  precisely  the  same  results  which  the  earlier  algebraic 
method  furnished  us. 


ALGEBRAICALLY  SOLVABLE  EQUATIONS.  297 

Theorem  XII.  The  general  solvable  equations  of  prime 
degree  p  are  those  of  §  196.  Their  group  is  of  order  p(p  —  1)  and 
consists  of  the  substitutions  of  the  form 

s=\z  az-\-a\    (a  =  l,  2,  ...p —  1;  a  =  0, 1, . .  .p  —  1)     (mod.  p). 

Its  factors  of  composition  are  all  prime  divisors  of  p  —  1,  each  fac- 
tor ocurring  as  many  times  as  it  occurs  in  p  —  1,  and  beside  these 
p  itself. 

§  246.  We  pass  to  the  general  solvable  primitive  equations  of 
degree  p2.     As  a  starting  point  we  have  the  arithmetic  substitutions 

tf  =  |  zx ,  z2   z}  +  «i ,  z2  +  «2 1     (mod.  p), 

which  form  the  last  group  M  of  the  corresponding  principal  series. 
To  arrive  at  the  next  preceding  group,  we  must  determine  a  substi- 
tution s  which  has  the  following  properties.     Its  form  is 

s=  |  zx ,  z2   axzx  -f-  bY  z2 ,  a2  zx  -\-b2z2  |     (mod.  p), 

and  the  lowest  power  of  .s  which  occurs  in  M,  and  is  therefore  of 
the  form  t,  must  have  a  prime  number  as  exponent.  Since  now  all 
the  powers  of  s  are  of  the  same  form  as  s  itself,  the  required  power 
must  be  j  zx ,  z2  zx ,  Z2 1  =  1.  That  is,  the  order  of  the  substitution 
s  must  be  a  prime  number. 

From  these  and  other  similar  considerations  we  arrive  at  the  fol- 
lowing results,  *  the  further  demonstration  of  which  we  do  not  enter 
upon. 

Theorem  XIII.  The  general  solvable,  primitive  equations 
of  degree  p2  are  of  three  different  types.  # 

The  first  type  is  characterized  by  a  group  of  order  2p2(p — l)2, 
the  substitutions  of  which  are  generated  by  the  following: 

\zuZ%   «!  +  «!,  «a  +  «a|      («i,  «2  =0,  1,  2,  .  .  .p  —  1), 

i  /  i    o  •->  i\      (mod.  p), 

|z,,z2   axzx,a2z2\  (a,,  a2,  =  l,  Z,  6,  .  .  ,p  —  1), 

The  groups  belonging  to  the  second  type  are  of  order  2  p2(p2 — 1), 
and  their  substitutions  are  generated  by  the  following : 

*C.  Jordan  :  Liouville,  Jour,  de  Math.  (2)  XIII,  pp.  111-135, 

20 


'2(,tS  THEORY    OF    SUBSTITUTIONS. 

\z^z,    z,  +  «,  ,z2  +  a2 1  (a,,  02=0,1,  2,  ...p—  1), 

\zx,z,  azi+bez^bz.  +  az.^  (a,6=0, 1,  .  .  .p  —  1;  6u<  not  a,b=EO), 
|4,*   «if— A|,  (mod.p). 

where  e  is  any  quadratic  remainder  (mod.  p). 

The  groups  of  the  third  type  are  of  order  24  p"(p —  1).  The 
form  of  their  substitutions  is  different,  according  as  p=l  or  p  =  3 
(mod,  4).  In  the  former  case  the  group  contains  beside  the  two 
substitutions 

|«n*i    3i  +  an  3a  +  Os|      (a,,a2  =  0,  1,  2,  .  .  .p  —  1),      /mod      \ 
2,  ,22   azj,az2i  (a=l,  2,  3...p —  1), 

aZso  Me  following  four: 

\zx,z2   izx,—iz2\,  \zx,z2   iz2,iz1\, 

\zlfz2   z1—iz2,zl  +  iz2\,     \z,,z2   z]  +  z2,zl  —  z2\, 

where  i  is  a  root  of  the  congruence  i2=  —  1  (mod.  p).  If  p  =  3 
(mod.  4),  the  group  contains  the  first  two  substitutions  above, 
together  with  the  following  four: 

\zx,Z2    Z2, 3,|,.  \Z1,Z2    SZx~\-tz.,,tzx — sz2\, 

\zx,Z2     —  (l+st)z1  +  (s  —  0Z2,    (t  +  s')Zi  +  (*t  —  8  —  t)z2\, 
\zt,Z2     SZ,  +  (1  +t)z.,,  (t l)z, SjS3|, 

where  s  and  t  satisfy  the  congruence  s2-\-t2  =  —  1  (mod.  p). 

For  p  =  3  the  first  and  second  types,  and  for  p  =  5  the  second 
type  are  not  general.  These  types  are  then  included  as  special 
cases  in  the  third  type,  which  is  always  general. 

§  247.  We  return  from  the  preceding  special  cases  to  the  more 
general  theory. 

The  same  method  which  we  have  employed  above  in  the  case  of 
p2  can  be  applied  in  general  to  determine  the  substitutions  of  the 
group  L  which  precedes  M  in  the  principal  series  of  composition. 
L  is  obtained  by  adding  to  the  substitutions 

t=\zx,Z2,  .  .  .ZK     Z,  +  ax,z2-\-a2,  .  .  .zK  +  aK)      (mod. p) 

of  M  a  further  substitution 

8=\zuz%i  . .  .  zK  axZr\-blz9+ *  .  .+c1zK,aazl+b&+ .  .  .+cazK,  . ..  | 

(mod.  p), 


ALGEBRAICALLY  SOLVABLE  EQUATIONS.  290 

where  the  first  power  of  s  to  occur  among  the  f  s  has  a  prime  expo 
nent.     Since  all  the  powers  of  s  are  of  the  same  form  as  s  itself, 
any  power  of   s  which  occurs  among  the  fs  must  be  equal  to  1. 
Consequently  8  must  be  of  prime  order.      It  is  further  necessary 
the  group  L  =  \  t,  s\   should  not  become  non-primitive. 

§  248.     From  the  form  to  which  the  substitutions  of  G  are  re- 
stricted, we  have  at  once 

Theorem  XIV.     All  the  substitutions,  except  identity,  which 
belong  to  the  group 

M=  \zx,Z2,...ZK      Zx  +  «, ,  z2  +  «,,...  ZK  -f  aK 

affect  all  the  elements. 

The  converse  proposition,  which  was  true  for  z  =  1,  does  not  hold 
in  the  general  case.     For  the  element  xZl  >  Zn  t ,  .  ,K  is  unaffected  by 

8—  \zx,z2,...z  alzx-\-bxzl+...-\-clzK+ax,  aiz1Jrb2z2-\-...-\- czz,  +  «,,...  | 

only  in  case  the  z  congruences 

(«i — l)^i  +  612:.,+  ...+  clzK  +  a1^0, 

a2z2  +  (b2  —  l)z2+  .  .  .  +  c2zK  +  a2— 0, 

b)  (mod.  p) 

aKzx+  bKz,-\-  ...  +(cK  — 1)^  +  ^=0 

are  satisfied.     Consequently,  as  soon  as  the  determinant 

ax  —  1  bx         .  . .  cx 
a2  b2  —  1 .  .  .  c2 


D  = 


;0     (mod.  p), 


aK         bK         .  .  .  cK  —  1 

the  «, ,  a2,  .  .  .  aK  can  be  so  chosen  that  the  congruences  S)  are  not 
satisfied  by  any  system  zx,z2,  .  .  .  zK. 

We  consider  now  all  the  substitutions  of  the  group  G  which 
leave  one  element  unchanged.  Since  the  distinction  between  the 
elements  is  merely  a  matter  of  notation,  we  may  regard  ;ro,o,...o  as 
the  fixed  element.  Then  the  substitutions  which  leave  this  element 
unchanged  are 

r=\zuzi,.'..zK  axzxJrbxz2Jr ...  -\-cxzK,  a2zx-\-b,_z2-\- ...-{■  c2zK...\. 

If  we  adjoin  a'0)0  ..„  to  the  equation,   the  group  G  reduces  to  /'. 


300  THEORY    OF    SUBSTITUTIONS. 

Since  all  the  substitutions  of  G  are  obtained  by  appending  to  those 
of  /'  the  constants  on  «2,  .  .  .  and  since  the  «'s  can  be  chosen  in  pK 
ways,  it  follows  that  the  adjunction  of  a  single  root  reduces  G  to  its 
(pK)th  part. 

§  249.  We  will  now  consider  the  possibility  that  a  substitution 
of  G  leaves  *  +  l  elements  j\,  % -,,...  ;)t  unchanged.  Then  the  con- 
gruences S)  of  the  preceding  Section  are  satisfied  by  *  +  1  systems 
of  values  zt ,  za , . . .  ZK 

Zi  =  ^w,  z2  =  :,'*>,  ...zK=  c««*)f      (;.  =  0, 1,  2, . .  .  x). 

We  will  however  regard  not  the  coefficients  a,  b,  .  .  .  c ;  a  of  the 
substitution  but  the  values  £,(*>,  r„a) .  .  .  f^W  as  known,  and  attempt 
to  determine  the  substitution  from  these  data.  If  now  the  determ- 
inant 


E 


is   not  =0  (mod.  p),  then  the  *   systems    T,),  TV),  . .  .  TK)    each  of 
x  -\-  1  congruences  with  the  unknown  quantities  a,  b,  .  .  .  c ;  a 

Tt)  (a,  - 1)  :,w  +        &,  :8w  + . . . + Cl :««  + «, =o, 

**«)  a,:^'  +(62_l)CaW  +  ...-f-c2C(tW  +  a9=0,  j 

r«)  a,  c,w        +  &.  :.w        + . . .  +  (cK — i)  :Kw  +  «K = o, 

have  only  one  solution  each,  viz: 

Lx)  «i  =  1,  &i  =  0,  t . .  Cx  =  0;  «!  =  0, 

L2)  Oj  =  0,  62  =  1,  .  . .  c2  =  0;  a2  =  0, 


'1         '2 

■s   1        -»  2      • 

•    •    •=    K 

c,w :,« . 

£«)  aK  =  0,  6K  =  0,  .  .  .cK=l;  «K  =  0, 

and  these  solutions  furnish  together  the  identical  substitution  1. 

We  designate  noiv  a  system  of  x  + 1  roots  of  an  equation  for 
which  E  =  0  (mod.  p)  as  a  system  of  conjugate  roots. 
We  have  then 

Theorem  XV.  If  a  substitution  of  a  primitive  solvable 
group  of  degree  pK  leaves  unchanged  x-\-l  roots  which  do  not 
form  a  conjugate  system,  the  substitution  reduces  to  identity. 


ALGEBRAICALLY    SOLVABLE*  EQUATIONS.  301 


?  1     ?  2       • 

'     1  '    2     • 

■*tt 

•    •     -       K 

coo  f>w  _ 

. .  e«« 

If  therefore  we^  adjoin  x  -+- 1  such  roots  to  the  equation,  the 
group  G  reduces  to  those  substitutions  which  leave  x  + 1  roots 
unchanged,  t.  e.,  to  the  identical  substitution.  The  equation  is  then 
solved. 

Theorem  XVI.  All  the  roots  of  a  solvable  primitive  equa- 
tion of  degree  pK  can  be  rationally  expressed  in  terms  of  any  x  -J-  1 
among  them,  provided  these  do  not  form  a  conjugate  system. 

If  we  choose  the  notation  so  that  one  of  the  x  -+- 1  roots  is 
#o  o  ...o,  the  determinant  becomes 


±E  = 


If  the  roots  are  not  to  form  a  conjugate  system,  then  i£=0 
(mod.  p).  The  number  r  of  systems  of  roots  which  satisfy  this  con- 
dition is  determined  in  §  146.     We  found 

r  =  (p«_l)  (p«— p)(p*— p2)  .  .  .{p*— p*-1). 
Theorem  XVII.     For  every  root  a?,,,^,...^  tve  can  deter- 
mine 

(ff«  — 1)  (pK—p)  .  •  ■  (pK—  PK~') 
1,  2, ...  x 

systems  of  /.  roots  each  such  that  these  *  + 1  roots  do  not  form  a  con- 
jugate system,  so  that  all  the  other  roots  can  be  rationally  expressed 
in  terms  of  them.     The  system  composed  of  the  x  + 1  roots 

3*0,0,0, ...J       •^l.O.O.-.OJ       3*0,1,0...  0»    ...   3*0,0,0,  ...  1 

is  appropriate  for  the  expression  of  all  the  roots. 

These  results  throw  a  new  light  on  our  earlier  investigations  in 
regard  to  triad  equations,  in  particular  on  the  solution  of  the  Hes- 
sian equation  of  the  ninth  degree  (cf.  §§  203-6 ).  It  is  plain  that 
we  can  construct  in  the  same  way  quadruple  equations  of  degree 
p3,  and  so  on. 


THE  LIBRARY 
UNIVERSITY  OF  CALIFORNIA 

Santa  Barbara 


THIS  BOOK  IS  DUE  ON  THE  LAST  DATE 
STAMPED  BELOW. 


9    25  OCT    99    5 


50m-9,'6ti(  G6338s8)9-182 


3  1205  00084  9743 


^jlJZ 


UC  SOUTHERN  REGIONAL  LIBRARY  FACILITY 


AA      000  191  980    2 


